Konferenzbeiträge

• Jan Arpe, Rüdiger Reischuk:
  Learning Juntas in the Presence of Noise,
  Proc. Theory and Applications of Models of Computation TAMC'2006, Beijing (China), May 2006,
  Springer Lecture Notes in Computer Science 3959, 387-398.
• Jan Arpe, Rüdiger Reischuk:
  On the Complexity of Optimal Grammar Based Compression,
  Proc. 16. Data Compression Conference DCC'2006, Snowbird (Utah), March 2006,
  IEEE Computer Society Press, 173-182.
• Bodo Mathey, Rüdiger Reischuk:
  Smoothed Analysis of Binary Search Trees,
  Proc. 16. Int. Symposium on Algorithms and Computation ISAAC'2005, Hainan (China), Dezember 2005,
  Springer Lecture Notes in Computer Science 3827, 483-492.
• Wolfgang Bein, Larry Larmore, Rüdiger Reischuk:
  Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems,
  Proc. Int. Symposium on parallel Architectures, Algorithms and Networks ISPAN'2004, Hong Kong, Mai 2004,
  IEEE Computer Society, 307-312.
• Bodo Mathey, Rüdiger Reischuk:
  The Intractability of Computing the Hamming Distance,
  Proc. 14. Int. Symposium on Algorithms and Computation ISAAC'2003, Kyoto, Dezember 2003,
  Springer Lecture Notes in Computer Science 2906, 88-97.
• John Case, Sanjey Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann:
  Learning a Subclass of Regular Pattern in Polynomial Time,
  Proc. 14 Int. Conference on Algorithmic Learning Theory  ALT'2003, Sapporo, Oktober 2003,
  Springer Lecture Notes in Computer Science 2842, 2842, 234-246.
• Jan Arpe, Rüdiger Reischuk:
  Robust Inference of Funtional Relations,
  Proc. 14 Int. Conference on Algorithmic Learning Theory  ALT'2003, Sapporo, Oktober 2003,
  Springer Lecture Notes in Computer Science 2842,  99-113.
• Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
  Private Computations in Networks: Topology versus Randomness,
  Proc. 21 GI Symposium on Theoretical Aspects of Computer Science STACS'2003, Berlin, Februar 2003,
  Springer Lecture Notes in Computer Science 2607, 121-132.
• Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
  Space Efficient Algorithms for Series-Parallel Graphs,
  Proc. 18 GI-MIMD Symposium on Theoretical Aspects of Computer Science STACS'2001, Dresden, Februar 2001,
  Springer Lecture Notes in Computer Science 2010, 339-352.
• Andreas Jakoby, Rüdiger Reischuk:
  Average Complexity of Unbounded Fanin Circuits,
  Proc.11. IEEE Conference on Computational Complexity COMPLEXITY'2000, Florenz, Juli 2000,
  IEEE Computer Society, 170-185.
• Stephan Weis, Rüdiger Reischuk:
  The Complexity of Physical Mapping with Strict Chimerism,
  Proc. 6. Int. Symposium on Computing and Combinatorics COCOON'2000, Sydney, Juli 2000,
  Springer Lecture Notes in Computer Science 1858,  383-395.
• Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
  The Expressive Power and Complexity of  Dynamic Process Graphs,
  Proc. 26. Int. Workshop on Graph-Theoretical Concepts in Computer Science WG'2000, Konstanz, Juni 2000,
   Springer Lecture Notes in Computer Science 1928,  230-242.
• Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
  Scheduling Dynamic Graphs,
  Proc. 16. GI-MIMD Symposium on Theoretical Aspects of Computer Science STACS'99, Trier, März 1999,
  Springer Lecture Notes in Computer Science 1563, 383-392.
• Rüdiger Reischuk, Thomas Zeugmann:
  A Complete and Tight Average-Case Analysis of Learning Monomials,
  Proc. 16. GI-MIMD Symposium on Theoretical Aspects of Computer Science STACS'99, Trier, März 1999,
  Springer Lecture Notes in Computer Science 1563, 414-423.
• Rüdiger Reischuk, Thomas Zeugmann:
  Learning One-Variable Pattern Languages in Linear Average Time,
  Proc. 11. Conf. on Computational Learning Theory COLT'98, Madison (Wisconsin), July 1998, 198-208.
• Maciej Liskiewicz, Rüdiger Reischuk:
  Computational Limitations of Stochastic Turing Machines and Arthur-Merlin Games with Small Space Bounds
  Proc. 22. Int. Symposium on Mathematical Foundations of Computer Science MFCS'97, Bratislava, August 1997,
  Springer Lecture Notes in Computer Science 1295, 91-107.
• Rüdiger Reischuk:
  Can Large Fanin Circuits Perform Reliable Computations in the Presence of Noise?
  Proc. 3. Int. Symposium on Computing and Combinatorics COCOON'97, Shanghai, August, 1997,
  Springer Lecture Notes in Computer Science 1276, 72-81.
• Andreas Jakoby, Rüdiger Reischuk:
  Data Transmission in Processor Networks
  Proc. 9. International Workshop on Distributed Algorithms WDAG'95, Le Mont Saint Michel, Frankreich, 1995,
  Springer Lecture Notes in Computer Science 972, 145-159 .
• Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer:
  Malign Distributions for Average Case Circuit Complexity
  Proc.12. GI-AFCET Symposium on Theoretical Aspects of Computer Science STACS'95 , München, 1995,
  Springer Lecture Notes in Computer Science 900, 628-639.
• Danny Dolev, Rüdiger Reischuk, Ray Strong
  Observable Clock Synchronisation
  Proc. 14. ACM Symposium on Principles of Distributed Computing PODC'94, Los Angeles, 1994, 284-293.
• Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer, Stephan Weis:
  The Average Case Complexity of the Parallel Prefix Problem
  Proc. 21. EATCS Int. Colloquium on Automata Theory, Languages and Computation ICALP'94 , Jerusalem, 1994,
  Springer Lecture Notes in Computer Science 820, 593-604.
• Maciej Liskiewicz, Rüdiger Reischuk:
  The Complexity World below Logarithmic Space
  Proc. 9. Ann. IEEE - SIGACT - EATCS Symposium on Structure in Complexity Theory STRUCTURES'94, Amsterdam, 1994, 64-78.
• Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer:
  The Complexity of Broadcasting in Planar and Decomposable Graphs
  Proc. 20. Int. Workshop on Graph-Theoretic Concepts in Computer Science WG'94 , Herrsching, 1994,
  Springer Lecture Notes in Computer Science 903, 219-231.
• Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer:
  Circuit Complexity: from the Worst Case to the Average Case
  Proc. 26. Ann. ACM Symposium on Theory of Computing STOC'94, Montréal, Québec, Canada. 1994, 58-67.
• Rüdiger Reischuk, Christian Schindelhauer:
  Precise Average Case Complexity
  Proc. 10. GI-AFCET Symposium on Theoretical Aspects of Computer Science STACS'93, Würzburg, 1993,
  Springer Lecture Notes in Computer Science 665, 650-661.
• Maciej Liskiewicz, Rüdiger Reischuk:
  Separating the Lower Levels of the Sublogarithmic Space Hierarchy
  Proc. 10. GI-AFCET Symposium on Theoretical Aspects of Computer Science STACS'93, Würzburg, 1993,
  Springer Lecture Notes in Computer Science 665, 16-27.
• Andreas Jakoby, Rüdiger Reischuk:
  The Complexity of Scheduling Problems with Communication Delays for Trees,
  Proc. 3. Skandinavian Workshop on Algorithmic Theory SWAT'92, Helsinki 1992,
  Springer Lecture Notes in Computer Science 621, 165-177.
• Rüdiger Reischuk, Bernd Schmeltz:
  Reliable Computation with Noisy Circuits and Decision Trees - A General n log n Lower Bound
  Proc. 32. Ann. IEEE Conference on Foundations of Computer Science FOCS'91, San Juan (Puerto Rico), 1991, 602-611.
• Rüdiger Reischuk:
  Graph Theoretical Methods for the Design of Parallel Algorithms
  Proc. 8. Conference on Fundamentals of Computation Theory FCT'91, Berlin, 1991,
  Springer Lecture Notes in Computer Science 529, 61-67 .
• Martin Dietzfelbinger, Mirek Kutylowski, Rüdiger Reischuk:
  Exact Time Bounds for Computing Boolean Functions on PRAMs without Simultaneous Writes
  Proc. 2. ACM Symposium on Parallel Algorithms and Architectures SPAA'90 , Kreta 1990, 125-135.
• Rüdiger Reischuk, Bernd Schmeltz:
  Area Efficient Methods to Increase the Reliability of Combinatorial Circuits
  Proc. 6. GI-AFCET Symposium on Theoretical Aspects of Computer Science STACS'89 , Paderborn 1989,
  Springer Lecture Notes in Computer Science 349, 314-326.
• Bernd Halstenberg, Rüdiger Reischuk:
  Relations between Communication Complexity Classes
  Proc. 3. Ann. IEEE - SIGACT - EATCS Symposium on Structure in Complexity Theory STRUCTURES'88, Washington DC 1988, 19-28.
• Bernd Halstenberg, Rüdiger Reischuk:
  On Different Modes of Communication
  Proc. 20. Ann. ACM Symposium on Theory of Computing STOC'88, Chicago (Illinois), 1988, 162-172.
• Rüdiger Reischuk:
  Konsistenz und Fehlertoleranz in Verteilten Systemen - Das Problem der Byzantinischen Generäle
  Proc. 17. GI-Jahrestagung, München 1987, Springer Informatik Fachberichte 156, 65-81.
• Hagit Attiya, A. Bar-Noy, Danny Dolev, David Peleg, Rüdiger Reischuk:
  Achievable Cases in an Asynchronous Environment
  Proc. 28. Ann. Symposium on Foundations of Computer Science FOCS'87, Los Angeles (California), 1987, 337-346.
• Meinolf Koshors, Rüdiger Reischuk:
  Lower Bounds for Synchronous Systems and the Advantage of Local Information
  Proc. 2. Int. Workshop on Distributed Algorithms WDAG'87, Amsterdam, 1987,
  Springer Lecture Notes in Computer Science 312, 374-387.
• Rüdiger Reischuk:
  Parallel Machines and their Communication Theoretical Limits
  Proc. 3. GI-AFCET Symposium on Theoretical Aspects of Computer Science STACS'86 , Paris 1986,
  Springer Lecture Notes in Computer Science 210, 359-368.
• Friedhelm Meyer auf der Heide, Rüdiger Reischuk:
  On the Limits to Speed up Parallel Machines by Large Hardware and Unbounded Communication
  Proc. 25. Ann. IEEE Symposium on Foundations of Computer Science FOCS'84, Palm Beach (Florida) 1984, 56-64.
• Rüdiger Reischuk:
  A New Solution for the Byzantine Generals Problem
  Proc. 5. Int. Conference on Foundations of Computation Theory FCT'83, Borgholm (Schweden) 1983,
  Springer Lecture Notes in Computer Science 158, 382-393.
• Pavol Duris, Zvi Galil, Wolfgang Paul, Rüdiger Reischuk:
  Two Nonlinear Lower Bounds
  Proc. 15. ACM Symposium on Theory of Computing STOC'83, Boston, Massachusetts, 1983, 127-132.
• Danny Dolev, Rüdiger Reischuk, Ray Strong:
  'Eventual' is Earlier than 'Immediate'
  Proc. 23. IEEE Ann. Symposium on Foundations of Computer Science FOCS'82, Chicago (Illinois), 1982, 196-203 .
• Danny Dolev, Rüdiger Reischuk:
  Bounds on Information Exchange for Byzantine Agreement
  Proc. 1. ACM Symposium on Principles of Distributed Computing PODC'82, Ottawa (Canada), 1982, 132-140.
• Rüdiger Reischuk:
  Probabilistic Parallel Algorithms for Sorting and Selection
  Proc. 22. IEEE Ann. Symposium on Foundations of Computer Science FOCS'81, Nashville (Tennessee) 1981, 212-219.
• Rüdiger Reischuk:
  A Fast Implementation of a Multidimensional Storage into a Tree Storage
  Proc. 7. EATCS International Colloquium on Automata Theory, Languages and Computation ICALP'80 Nordwijkerhood (Netherlands) 1980,
  Springer Lecture Notes in Computer Science 85, 531-542.
• Wolfgang Paul, Rüdiger Reischuk:
  On Time versus Space II
  Proc. 20. IEEE Ann. Symposium on Foundations of Computer Science FOCS'79, San Juan (Puerto Rico) 1979, 298-306.
• Wolfgang Paul, Rüdiger Reischuk:
  On Alternation II - A Graph Theoretic Approach to Determinism versus Nondeterminism
  Proc. 4. GI Tagung on Theoretical Computer Science, Aachen 1979,
  Springer Lecture Notes in Computer Science 67, 222-232.
• Wolfgang Paul und Ernst Prauss, Rüdiger Reischuk:
  On Alternation
  Proc. 19. IEEE Ann. Symposium on Foundations of Computer Science FOCS'78, Ann Arbor (Michigan), 1978, 113-122.
• Rüdiger Reischuk:
  Improved Bounds on the Problem of Time-Space Trade-Offs in the Pebble Game
  Proc. 19. IEEE Ann. Symposium on Foundations of Computer Science FOCS'78, Ann Arbor (Michigan), 1978, 84-91.