Reischuk, R�diger - Institut f�r Theoretische Informatik, Universit�t zu L�beck

Advanced Search

Reischuk, R�diger - Institut f�r Theoretische Informatik, Universit�t zu L�beck

Scheduling Dynamic Graphs \Lambda Andreas Jakoby 1;3 Maciej Li'skiewicz 2 Rudiger Reischuk 1
SIIM TRA0414 SIIM Technical Report
Learning OneVariable Pattern Languages in Linear Average Time
Space Efficient Algorithms for SeriesParallel Graphs Andreas Jakoby 1;2 Maciej Li'skiewicz 1 Rudiger Reischuk 1
The Average Case Complexity of the Parallel Prefix Problem
Space Bounds for Interactive Proof Systems with Public Coins and Bounded Number of Rounds
A Decentralized High Performance Time Service Architecture
Data Transmission in Processor Networks Andreas Jakoby ?
A Complete and Tight AverageCase Analysis of Learning Monomials
SIIM TRA0517 SIIM Technical Report
Medizinische Universitat Lubeck 1 Malign Distributions for
The Sublogarithmic Alternating Space World \Lambda Maciej Li'skiewicz y Rudiger Reischuk z
Grey-Box Steganography Maciej Liskiewicz, Rudiger Reischuk, and Ulrich Wolfel
Grey-Box Steganography Maciej Liskiewicz, Rudiger Reischuk, and Ulrich Wolfel
Observable Clock Synchronization Danny Dolev \Lambda
Circuit Complexity: from the Worst Case to the Average Case \Lambda
Can Large Fanin Circuits Perform Reliable Computations
The Expressive Power and Complexity of Dynamic Process Graphs \Lambda
An AverageCase Optimal OneVariable Pattern Language Learner
Analysing Data Access Strategies in Cache Coherent Architectures
Feasible TimeOptimal Algorithms for Boolean Functions on ExclusiveWrite PRAMs \Lambda
SIIM TR A 0217 SIIM Technical Report
Average Case Complexity of Unbounded Fanin Circuits Andreas Jakoby 1;2 and Rudiger Reischuk 2
The Complexity World below Logarithmic Space
The Complexity of Broadcasting in Planar and Decomposable Graphs
Dynamic Process Graphs and the Complexity of Scheduling \Lambda Andreas Jakoby 1;2 Maciej Li'skiewicz 2 Rudiger Reischuk 2
SIIM TRA0312 SIIM Technical Report