Schriftenreihe der Institute für Informatik/Mathematik der Universität zu Lübeck
SIIM-TR-A
-
[SIIM-TR-A-05-17] Bodo Manthey, Rüdiger Reischuk:
Smoothed Analysis of Binary Search Trees (Abstract,
Full Paper).
- [SIIM-TR-A-04-14] Jan Arpe, Rüdiger Reischuk:
On the
Complexity of Optimal Grammar Based Compression (Abstract,
Full
Paper).
- [SIIM-TR-A-03-12] Jan Arpe, Rüdiger Reischuk:
Robust Inference
of Functional Relations (Abstract,
Full Paper).
-
[SIIM-TR-A-02-17] Bodo Manthey, Rüdiger Reischuk:
The Intractability
of Computing the Hamming Distance (Abstract,
Full Paper).
-
[SIIM-TR-A-00-17] Andreas Jakoby, Maciej Liskiewicz, Rüdiger
Reischuk:
Space Efficient Algorithms for Series-Parallel
Graphs (Abstract, Full Paper).
-
[SIIM-TR-A-00-07] Andreas Jakoby, Maciej Liskiewicz, Rüdiger
Reischuk:
The Expressive Power and Complexity of Dynamic Process Graphs
(Abstract, Full Paper).
-
[SIIM-TR-A-00-02] Andreas Jakoby, Maciej Liskiewicz, Rüdiger
Reischuk:
Dynamic Process Graphs and the Complexity of Scheduling (Abstract,
Full Paper).
-
[SIIM-TR-A-98-25] Karin Genther, Rüdiger Reischuk:
Analysing
Data Access Strategies in Cache Coherent Architectures (Abstract,
Full Paper).
-
[SIIM-TR-A-98-22] Rüdiger Reischuk, Thomas Zeugmann:
An Average-Case
Optimal One-Variable Pattern Learner (Abstract,
Full Paper,
Implementation-Animation).
-
[SIIM-TR-A-98-17] Andreas Jakoby, Rüdiger Reischuk:
Average
Case Complexity of Unbounded Fanin Circuits (Abstract,
Full Paper [revised version January 2000]).
-
[SIIM-TR-A-98-15] Rüdiger Reischuk, Thomas Zeugmann:
A
Complete and Tight Average-Case Analysis of Learning Monomials (Abstract,
Full
Paper
-
[SIIM-TR-A-98-07] Andreas Jakoby, Maciej Liskiewicz,
Rüdiger Reischuk:
Scheduling Dynamic Graphs (Abstract,
Full
Paper).
-
[SIIM-TR-A-97-15] Andreas Jakoby, Rüdiger Reischuk:
Scheduling Trees with Communication Delays (Abstract,
Full
Paper).
-
[SIIM-TR-A-97-13] Rüdiger Reischuk, Thomas Zeugmann:
Learning One-Variable Pattern Languages in Linear Average Time (Abstract,
Full
Paper).
-
[SIIM-TR-A-97-05] Rüdiger Reischuk: Can Large Fanin
Circuits Perform Reliable Computations in the Presence of Faults? (Abstract,
Full
Paper (Version August 98)).
-
[SIIM-TR-A-96-17] Maciej Liskiewicz, Rüdiger Reischuk:
Separating Small Space Complexity Classes of Stochastic Turing Machines (Abstract,
Technical
Report, Full
Paper).
-
[SIIM-TR-A-96-08] Maciej Liskiewicz, Rüdiger Reischuk:
Space Bounds for Interactive Proof Systems with Public Coins and Bounded
Number of Rounds (Abstract,
Full
Paper).
-
[SIIM-TR-A-96-07] Rüdiger Reischuk:
Zeit und Raum in
Rechnernetzen
(Abstract,
Full
Paper).
-
[SIIM-TR-A-95-26] Danny Dolev, Rüdiger Reischuk, Ray
Strong, Ed Wimmers:
A Decentralized High Performance Time Service Architecture
(Abstract,
Full
Paper).
-
[SIIM-TR-A-95-18] Andreas Jakoby, Rüdiger Reischuk:
Data Transmission
in Processor Networks (Abstract,
Full
Paper).
-
[SIIM-TR-A-95-08] Andreas Jakoby, Rüdiger Reischuk,
Christian Schindelhauer:
The Complexity of Broadcasting in Planar and
Decomposable Graphs (Abstract,
Full
Paper).
-
[SIIM-TR-A-95-07] Maciej Liskiewicz, Rüdiger Reischuk:
The Complexity World below Logarithmic Space (Abstract,
Full
Paper).
-
[SIIM-TR-A-95-06] Andreas Jakoby, Rüdiger Reischuk,
Christian Schindelhauer:
Malign Distributions for Average Case Circuit Complexity
(Abstract,
Technical
Report, Full
Paper).
-
[SIIM-TR-A-95-05] Martin Dietzfelbinger, Miroslaw
Kutylowski, Rüdiger Reischuk:
Feasible Time-Optimal Algorithms for Boolean Functions on
Exclusive - Write PRAMS (Abstract,
Full
Paper).
-
[SIIM-TR-A-95-04] Danny Dolev, Rüdiger Reischuk, Ray
Strong:
Observable Clock Synchronization (Abstract,
Full Paper).
-
[SIIM-TR-A-95-03] Andreas Jakoby, Rüdiger Reischuk,
Christian Schindelhauer, Stephan Weis:
The Average Case Complexity of the
Parallel Prefix Problem (Abstract,
Full
Paper).
-
[SIIM-TR-A-95-02] Andreas Jakoby, Rüdiger Reischuk,
Christian Schindelhauer:
Circuit Complexity: from the Worst Case to the Average
Case (Abstract,
Full Paper).
-
[SIIM-TR-A-95-01] Maciej Liskiewicz, Rüdiger Reischuk:
The Sublogarithmic Alternating Space World (Abstract,
Full
Paper).