 | 2009 |
|---|
| 108 |       | Wolfgang W. Bein,
Lawrence L. Larmore,
Rüdiger Reischuk:
Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems.
Int. J. Found. Comput. Sci. 20(1): 167-183 (2009) |
| 107 | | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk,
Christian Schindelhauer:
Improving the average delay of sorting.
Theor. Comput. Sci. 410(11): 1030-1041 (2009) |
| 2008 |
|---|
| 106 |  | Berthold Vöcking,
Helmut Alt,
Martin Dietzfelbinger,
Rüdiger Reischuk,
Christian Scheideler,
Heribert Vollmer,
Dorothea Wagner:
Taschenbuch der Algorithmen
Springer 2008 |
| 105 | | Wolfgang W. Bein,
Lawrence L. Larmore,
Rüdiger Reischuk:
Knowledge States: A Tool for Randomized Online Algorithms.
HICSS 2008: 476 |
| 104 | | Rüdiger Reischuk,
Markus Hinkelmann:
Einweg-Funktionen: Vorsicht Falle - Rückweg nur für Eingeweihte!.
Taschenbuch der Algorithmen 2008: 139-148 |
| 2007 |
|---|
| 103 | | Jan Arpe,
Rüdiger Reischuk:
When Does Greedy Learning of Relevant Attributes Succeed?
COCOON 2007: 296-306 |
| 102 | | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk,
Christian Schindelhauer:
Improving the Average Delay of Sorting.
TAMC 2007: 330-341 |
| 101 | | Wolfgang W. Bein,
Lawrence L. Larmore,
Rüdiger Reischuk:
Knowledge State Algorithms: Randomization with Limited Information
CoRR abs/cs/0701142: (2007) |
| 100 | | Bodo Manthey,
Rüdiger Reischuk:
Smoothed analysis of binary search trees.
Theor. Comput. Sci. 378(3): 292-315 (2007) |
| 99 | | Jan Arpe,
Rüdiger Reischuk:
Learning juntas in the presence of noise.
Theor. Comput. Sci. 384(1): 2-21 (2007) |
| 98 | | Maciej Liskiewicz,
Rüdiger Reischuk:
Preface.
Theory Comput. Syst. 41(2): 209-210 (2007) |
| 2006 |
|---|
| 97 | | Matthias Krause,
Pavel Pudlák,
Rüdiger Reischuk,
Dieter van Melkebeek:
Complexity of Boolean Functions, 12.03. - 17.03.2006
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 |
| 96 | | Matthias Krause,
Pavel Pudlák,
Rüdiger Reischuk,
Dieter van Melkebeek:
06111 Abstracts Collection -- Complexity of Boolean Functions.
Complexity of Boolean Functions 2006 |
| 95 | | Matthias Krause,
Dieter van Melkebeek,
Pavel Pudlák,
Rüdiger Reischuk:
06111 Executive Summary -- Complexity of Boolean Functions.
Complexity of Boolean Functions 2006 |
| 94 | | Jan Arpe,
Rüdiger Reischuk:
On the Complexity of Optimal Grammar-Based Compression.
DCC 2006: 173-182 |
| 93 | | Jan Arpe,
Rüdiger Reischuk:
Learning Juntas in the Presence of Noise.
TAMC 2006: 387-398 |
| 92 | | Jan Arpe,
Rüdiger Reischuk:
When Does Greedy Learning of Relevant Features Succeed? --- A Fourier-based Characterization ---.
Electronic Colloquium on Computational Complexity (ECCC) 13(065): (2006) |
| 91 | | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk:
Space efficient algorithms for directed series-parallel graphs.
J. Algorithms 60(2): 85-114 (2006) |
| 90 | | Nicolò Cesa-Bianchi,
Rüdiger Reischuk,
Thomas Zeugmann:
Foreword.
Theor. Comput. Sci. 350(1): 1-2 (2006) |
| 89 | | John Case,
Sanjay Jain,
Rüdiger Reischuk,
Frank Stephan,
Thomas Zeugmann:
Learning a subclass of regular patterns in polynomial time.
Theor. Comput. Sci. 364(1): 115-131 (2006) |
| 2005 |
|---|
| 88 | | Maciej Liskiewicz,
Rüdiger Reischuk:
Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings
Springer 2005 |
| 87 | | Bodo Manthey,
Rüdiger Reischuk:
Smoothed Analysis of Binary Search Trees.
ISAAC 2005: 483-492 |
| 86 | | Bodo Manthey,
Rüdiger Reischuk:
Smoothed Analysis of the Height of Binary Search Trees
Electronic Colloquium on Computational Complexity (ECCC)(063): (2005) |
| 85 | | Bodo Manthey,
Rüdiger Reischuk:
The intractability of computing the Hamming distance.
Theor. Comput. Sci. 337(1-3): 331-346 (2005) |
| 2004 |
|---|
| 84 | | Wolfgang W. Bein,
Lawrence L. Larmore,
Rüdiger Reischuk:
Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems.
ISPAN 2004: 307-312 |
| 83 | | John Case,
Sanjay Jain,
Rüdiger Reischuk,
Frank Stephan,
Thomas Zeugmann:
A Polynomial Time Learner for a Subclass of Regular Patterns
Electronic Colloquium on Computational Complexity (ECCC)(038): (2004) |
| 82 | | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk:
Approximating schedules for dynamic process graphs efficiently.
J. Discrete Algorithms 2(4): 471-500 (2004) |
| 2003 |
|---|
| 81 | | John Case,
Sanjay Jain,
Rüdiger Reischuk,
Frank Stephan,
Thomas Zeugmann:
Learning a Subclass of Regular Patterns in Polynomial Time.
ALT 2003: 234-246 |
| 80 | | Jan Arpe,
Rüdiger Reischuk:
Robust Inference of Relevant Attributes.
ALT 2003: 99-113 |
| 79 | | Bodo Manthey,
Rüdiger Reischuk:
The Intractability of Computing the Hamming Distance.
ISAAC 2003: 88-97 |
| 78 | | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk:
Private Computations in Networks: Topology versus Randomness.
STACS 2003: 121-132 |
| 2002 |
|---|
| 77 | | Nicolò Cesa-Bianchi,
Masayuki Numao,
Rüdiger Reischuk:
Algorithmic Learning Theory, 13th International Conference, ALT 2002, Lübeck, Germany, November 24-26, 2002, Proceedings
Springer 2002 |
| 76 | | Nicolò Cesa-Bianchi,
Masayuki Numao,
Rüdiger Reischuk:
Editors' Introduction.
ALT 2002: 1-6 |
| 75 | | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk:
Space Efficient Algorithms for Directed Series-Parallel Graphs
Electronic Colloquium on Computational Complexity (ECCC)(021): (2002) |
| 2001 |
|---|
| 74 | | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk:
Space Efficient Algorithms for Series-Parallel Graphs.
STACS 2001: 339-352 |
| 73 | | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk:
Dynamic Process Graphs and the Complexity of Scheduling
Electronic Colloquium on Computational Complexity (ECCC)(090): (2001) |
| 72 | | Rüdiger Reischuk:
Approximating Schedules for Dynamic Graphs Efficiently
Electronic Colloquium on Computational Complexity (ECCC) 8(38): (2001) |
| 2000 |
|---|
| 71 | | Stephan Weis,
Rüdiger Reischuk:
The Complexity of Physical Mapping with Strict Chimerism.
COCOON 2000: 383-395 |
| 70 | | Andreas Jakoby,
Rüdiger Reischuk:
Average Case Complexity of Unbounded Fanin Circuits.
IEEE Conference on Computational Complexity 2000: 170- |
| 69 | | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk:
The Expressive Power and Complexity of Dynamic Process Graphs.
WG 2000: 230-242 |
| 68 | | Rüdiger Reischuk,
Thomas Zeugmann:
An Average-Case Optimal One-Variable Pattern Language Learner.
J. Comput. Syst. Sci. 60(2): 302-335 (2000) |
| 67 | | Rüdiger Reischuk:
Can large fanin circuits perform reliable computations in the presence of faults?
Theor. Comput. Sci. 240(2): 319-335 (2000) |
| 1999 |
|---|
| 66 | | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk:
Scheduling Dynamic Graphs.
STACS 1999: 383-392 |
| 65 | | Rüdiger Reischuk,
Thomas Zeugmann:
A Complete and Tight Average-Case Analysis of Learning Monomials.
STACS 1999: 414-423 |
| 64 | | Maciej Liskiewicz,
Rüdiger Reischuk:
On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games.
Computational Complexity 8(3): 273-307 (1999) |
| 63 | | Andreas Jakoby,
Rüdiger Reischuk,
Christian Schindelhauer:
Malign Distributions for Average Case Circuit Complexity.
Inf. Comput. 150(2): 187-208 (1999) |
| 1998 |
|---|
| 62 | | Rüdiger Reischuk,
Thomas Zeugmann:
Learning One-Variable Pattern Languages in Linear Average Time.
COLT 1998: 198-208 |
| 61 | | Andreas Jakoby,
Rüdiger Reischuk,
Christian Schindelhauer:
The complexity of broadcasting in planar and decomposable graphs.
Discrete Applied Mathematics 83(1-3): 179-206 (1998) |
| 60 | | Rüdiger Reischuk,
Thomas Zeugmann:
An Average-Case Optimal One-Variable Pattern Language Learner
Electronic Colloquium on Computational Complexity (ECCC) 5(69): (1998) |
| 59 | | Rüdiger Reischuk:
Can Large Fanin Circuits Perform Reliable Computations in the Presence of Noise?
Electronic Colloquium on Computational Complexity (ECCC) 5(70): (1998) |
| 1997 |
|---|
| 58 | | Rüdiger Reischuk,
Michel Morvan:
STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997, Proceedings
Springer 1997 |
| 57 | | Rüdiger Reischuk:
Can Large Fanin Circuits Perform Reliable Computations in the Presence of Noise ?
COCOON 1997: 72-81 |
| 56 | | Maciej Liskiewicz,
Rüdiger Reischuk:
Computational Limitations of Stochastic Turing Machines and Arthur-Merlin Games with Small Space Bounds.
MFCS 1997: 91-107 |
| 55 | | Rüdiger Reischuk,
Christian Schindelhauer:
An Average Complexity Measure that Yields Tight Hierarchies.
Computational Complexity 6(2): 133-173 (1997) |
| 54 | | Danny Dolev,
Rüdiger Reischuk,
Fred B. Schneider,
H. Raymond Strong:
Report Dagstuhl Seminar on Time Services, Schloß Dagstuhl, March 11-15, 1996.
Real-Time Systems 12(3): 329-345 (1997) |
| 1996 |
|---|
| 53 | | Claude Puech,
Rüdiger Reischuk:
STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings
Springer 1996 |
| 52 | | Maciej Liskiewicz,
Rüdiger Reischuk:
The Sublogarithmic Alternating Space World.
SIAM J. Comput. 25(4): 828-861 (1996) |
| 51 | | Martin Dietzfelbinger,
Miroslaw Kutylowski,
Rüdiger Reischuk:
Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines.
SIAM J. Comput. 25(6): 1196-123 (1996) |
| 1995 |
|---|
| 50 | | Andreas Jakoby,
Rüdiger Reischuk,
Christian Schindelhauer:
Malign Distributions for Average Case Circuit Complexity.
STACS 1995: 628-639 |
| 49 | | Andreas Jakoby,
Rüdiger Reischuk:
Data Transmission in Processor Networks.
WDAG 1995: 145-159 |
| 48 | | Martin Dietzfelbinger,
Miroslaw Kutylowski,
Rüdiger Reischuk:
Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write PRAMs
Electronic Colloquium on Computational Complexity (ECCC) 2(4): (1995) |
| 47 | | Maciej Liskiewicz,
Rüdiger Reischuk:
The Sublogarithmic Alternating Space World
Electronic Colloquium on Computational Complexity (ECCC) 2(5): (1995) |
| 1994 |
|---|
| 46 | | Andreas Jakoby,
Rüdiger Reischuk,
Christian Schindelhauer,
Stephan Weis:
The Average Case Complexity of the Parallel Prefix Problem.
ICALP 1994: 593-604 |
| 45 | | Danny Dolev,
Rüdiger Reischuk,
H. Raymond Strong:
Observable Clock Synchronization (Extended Abstract).
PODC 1994: 284-293 |
| 44 | | Andreas Jakoby,
Rüdiger Reischuk,
Christian Schindelhauer:
Circuit complexity: from the worst case to the average case.
STOC 1994: 58-67 |
| 43 | | Maciej Liskiewicz,
Rüdiger Reischuk:
The Complexity World below Logarithmic Space.
Structure in Complexity Theory Conference 1994: 64-78 |
| 42 | | Andreas Jakoby,
Rüdiger Reischuk,
Christian Schindelhauer:
The Complexity of Broadcasting in Planar and Decomposable Graphs.
WG 1994: 219-231 |
| 41 | | Martin Dietzfelbinger,
Miroslaw Kutylowski,
Rüdiger Reischuk:
Exact Lower Time Bounds for Computing Boolean Functions on CREW PRAMs.
J. Comput. Syst. Sci. 48(2): 231-254 (1994) |
| 1993 |
|---|
| 40 | | Maciej Liskiewicz,
Rüdiger Reischuk:
Separating the Lower Levels of the Sublogarithmic Space Hierarchy.
STACS 1993: 16-27 |
| 39 | | Rüdiger Reischuk,
Christian Schindelhauer:
Precise Average Case Complexity.
STACS 1993: 650-661 |
| 38 | | Bernd Halstenberg,
Rüdiger Reischuk:
Different Modes of Communication.
SIAM J. Comput. 22(5): 913-934 (1993) |
| 1992 |
|---|
| 37 | | Rüdiger Reischuk,
Bernd Schmeltz:
Area Efficient Methods to Increase the Reliability of Circuits.
Data Structures and Efficient Algorithms 1992: 363-389 |
| 36 | | Andreas Jakoby,
Rüdiger Reischuk:
The Complexity of Scheduling Problems with Communication Delays for Trees.
SWAT 1992: 165-177 |
| 1991 |
|---|
| 35 | | Rüdiger Reischuk:
Graph Theoretical Methods for the Design of Parallel Algorithms.
FCT 1991: 61-67 |
| 34 | | Rüdiger Reischuk,
Bernd Schmeltz:
Reliable Computation with Noisy Circuits and Decision Trees-A General n log n Lower Bound
FOCS 1991: 602-611 |
| 1990 |
|---|
| 33 | | Rüdiger Reischuk:
Einführung in die Komplexitätstheorie
Teubner 1990 |
| 32 | | Martin Dietzfelbinger,
Miroslaw Kutylowski,
Rüdiger Reischuk:
Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous Writes.
SPAA 1990: 125-135 |
| 31 | | Hagit Attiya,
Amotz Bar-Noy,
Danny Dolev,
David Peleg,
Rüdiger Reischuk:
Renaming in an Asynchronous Environment
J. ACM 37(3): 524-548 (1990) |
| 30 | | Danny Dolev,
Rüdiger Reischuk,
H. Raymond Strong:
Early Stopping in Byzantine Agreement
J. ACM 37(4): 720-741 (1990) |
| 29 | | Bernd Halstenberg,
Rüdiger Reischuk:
Relations between Communication Complexity Classes.
J. Comput. Syst. Sci. 41(3): 402-429 (1990) |
| 1989 |
|---|
| 28 | | Rüdiger Reischuk,
Bernd Schmeltz:
Area Efficient Methods to Increase the Reliability of Combinatorial Circuits.
STACS 1989: 314-326 |
| 1988 |
|---|
| 27 | | Bernd Halstenberg,
Rüdiger Reischuk:
On Different Modes of Communication (Extended Abstract)
STOC 1988: 162-172 |
| 1987 |
|---|
| 26 | | Hagit Attiya,
Amotz Bar-Noy,
Danny Dolev,
Daphne Koller,
David Peleg,
Rüdiger Reischuk:
Achievable Cases in an Asynchronous Environment (Extended Abstract)
FOCS 1987: 337-346 |
| 25 | | Rüdiger Reischuk:
Konsistenz und Fehlertoleranz in Verteilten Systemen - Das Problem der Byzantinischen Generäle.
GI Jahrestagung 1987: 65-81 |
| 24 | | Rüdiger Reischuk,
Meinolf Koshors:
Lower Bounds for Synchronous Networks and the Advantage of Local Information.
WDAG 1987: 374-387 |
| 23 | | Rüdiger Reischuk:
Simultaneous WRITES of parallel random access machines do not help to compute simple arithmetic functions.
J. ACM 34(1): 163-178 (1987) |
| 1986 |
|---|
| 22 | | Rüdiger Reischuk:
Parallel Machines and their Communication Theoretical Limits.
STACS 1986: 359-368 |
| 21 | | Stephen Cook,
Cynthia Dwork,
Rüdiger Reischuk:
Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes.
SIAM J. Comput. 15(1): 87-97 (1986) |
| 1985 |
|---|
| 20 | | Rüdiger Reischuk:
A New Solution for the Byzantine Generals Problem
Information and Control 64(1-3): 23-42 (1985) |
| 19 | | Danny Dolev,
Rüdiger Reischuk:
Bounds on Information Exchange for Byzantine Agreement
J. ACM 32(1): 191-204 (1985) |
| 18 | | Rüdiger Reischuk:
Probabilistic Parallel Algorithms for Sorting and Selection.
SIAM J. Comput. 14(2): 396-409 (1985) |
| 1984 |
|---|
| 17 | | Friedhelm Meyer auf der Heide,
Rüdiger Reischuk:
On the Limits to Speed Up Parallel Machines by Large Hardware and Unbounded Communication
FOCS 1984: 56-64 |
| 16 | | Pavol Duris,
Zvi Galil,
Wolfgang J. Paul,
Rüdiger Reischuk:
Two Nonlinear Lower Bounds for On-Line Computations
Information and Control 60(1-3): 1-11 (1984) |
| 1983 |
|---|
| 15 | | Rüdiger Reischuk:
A New Solution for the Byzantine Generals Problem (Extended Abstract).
FCT 1983: 382-393 |
| 14 | | Pavol Duris,
Zvi Galil,
Wolfgang J. Paul,
Rüdiger Reischuk:
Two Nonlinear Lower Bounds
STOC 1983: 127-132 |
| 1982 |
|---|
| 13 | | Danny Dolev,
Rüdiger Reischuk,
H. Raymond Strong:
`Eventual' Is Earlier than `Immediate'
FOCS 1982: 196-203 |
| 12 | | Danny Dolev,
Rüdiger Reischuk:
Bounds on Information Exchange for Byzantine Agreement.
PODC 1982: 132-140 |
| 11 | | Rüdiger Reischuk:
A Fast Implementation of a Multidimensional Storage Into a Tree Storage.
Theor. Comput. Sci. 19: 253-266 (1982) |
| 1981 |
|---|
| 10 | | Rüdiger Reischuk:
A Fast Probabilistic Parallel Sorting Algorithm
FOCS 1981: 212-219 |
| 9 | | Wolfgang J. Paul,
Rüdiger Reischuk:
On Time versus Space II. (Turing Machines).
J. Comput. Syst. Sci. 22(3): 312-327 (1981) |
| 1980 |
|---|
| 8 | | Rüdiger Reischuk:
A "Fast Implementation" of a Multidimensional Storage into a Tree Storage.
ICALP 1980: 531-542 |
| 7 | | Wolfgang J. Paul,
Ernst J. Prauß,
Rüdiger Reischuk:
On Alternation.
Acta Inf. 14: 243-255 (1980) |
| 6 | | Wolfgang J. Paul,
Rüdiger Reischuk:
On Alternation II. A Graph Theoretic Approach to Determinism Versus Nondeterminism.
Acta Inf. 14: 391-403 (1980) |
| 5 | | Rüdiger Reischuk:
Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game.
J. ACM 27(4): 839-849 (1980) |
| 1979 |
|---|
| 4 | | Wolfgang J. Paul,
Rüdiger Reischuk:
On Time versus Space II
FOCS 1979: 298-306 |
| 3 | | Wolfgang J. Paul,
Rüdiger Reischuk:
A Graph Theoretic Approach to Determinism versus Non-Determinism.
Theoretical Computer Science 1979: 222-232 |
| 1978 |
|---|
| 2 | | Wolfgang J. Paul,
Ernst J. Prauß,
Rüdiger Reischuk:
On Alternation (Preliminary Version)
FOCS 1978: 113-122 |
| 1 | | Rüdiger Reischuk:
Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game (Preliminary Version)
FOCS 1978: 84-91 |
