50 years Univerity of Lübeck

Prof. Dr. math. K. Rüdiger Reischuk

Journal Publications


Zeitschriften-Beiträge / Journal Publications

  • John Case, Sanjey Jain, Rüdiger Reischuk, Thomas Zeugmann:
    Learning a Subclass of Regular Patterns in Polynomial Time,
    Theoretical Computer Science 364, 2006, 115-131.
  • Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
    Space Efficient Algorithms for Directed Series-Parallel Graphs,
    Journal of Algorithms 60, 2006, 331-346.
  • Bodo Manthey, Rüdiger Reischuk:
    The Intractability of Computing the Hamming Distance,
    Theoretical Computer Science 337, 2005, 331-346.
  • Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
    Approximating Schedules for Dynamic Graphs Efficiently,
    Journal on Discrete Algorithms 2, 2004, 471-500.
  • Rüdiger Reischuk:
    Can Large Fanin Circuits Perform Reliable Computations in the Presence of Faults?,
    Theoretical Computer Science 240, 2000, 319-335.
  • Rüdiger Reischuk, Thomas Zeugmann:
    An Average-Case Optimal One-Variable Pattern Language Learner,
    J. Computer and System Sciences 60, 2000, 302-335.
  • Maciej Liskiewicz, Rüdiger Reischuk:
    On Small Space Complexity Classes of Stochastic Turing Machines and Arthur-Merlin-Games,
    Computational Complexity 8, 1999, 273-307.
  • Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer:
    Malign Distributions for Average Case Circuit Complexity
    Information & Computation 150, 1999, 187-208.
  • Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer:
    The Complexity of Broadcasting in Planar and Decomposable Graphs
    Discrete Applied Mathematics 83, 1998, 179-206,
    also included in special issue "Discrete Applied Mathematics - Editors' Choice 1988".
  • Rüdiger Reischuk, Christian Schindelhauer:
    An Average Complexity Measure that Yields Tight Hierarchies
    Computational Complexity 6, 1996/97, 133-173.
  • Martin Dietzfelbinger, Mirek Kutylowski, Rüdiger Reischuk:
    Feasable Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines
    SIAM J. on Computing 25, 1996, 1196-1230.
  • Maciej Liskiewicz, Rüdiger Reischuk:
    The Sublogarithmic Alternating Space World
    SIAM J. on Computing 25, 1996, 828-861.
  • Martin Dietzfelbinger, Mirek Kutylowski, Rüdiger Reischuk:
    Exact Lower Bounds for Computing Boolean Functions on CREW PRAMs
    J. Computer and System Sciences 48, 1994, 231-254.
  • Bernd Halstenberg, Rüdiger Reischuk:
    Different Modes of Communication
    SIAM J. on Computing 22, 1993, 913-934.
  • Willmar Plewka, Rüdiger Reischuk:
    Grundlagen parallelen Rechnens -- Maschinenmodelle und Klassifikation algorithmischer Probleme
    Handbuch der Modernen Datenverarbeitung 155, 1990, 3-19.
  • Hagit Attiya, A. Bar-Noy, Danny Dolev, David Peleg, Rüdiger Reischuk:
    Renaming in an Asynchronous Environment
    J. ACM 37, 1990, 524-548.
  • Bernd Halstenberg, Rüdiger Reischuk:
    Relations between Communication Complexity Classes
    J. Computer and System Sciences 41, 1990, 402-429.
  • Danny Dolev, Rüdiger Reischuk, Ray Strong:
    Early Stopping in Byzantine Agreement
    J. ACM 37, 1990, 720-741.
  • Rüdiger Reischuk:
    Parallele Rechnermodelle und Komplexit"atsklassen
    Informationstechnik IT 31, 1989, 59-77.
  • Rüdiger Reischuk:
    Simultaneous Writes of Parallel Random Access Machines Do not Help to Compute Simple Arithmetic Functions
    J. ACM 34, 1987, 163-178.
  • Steve Cook, Cynthia Dwork, Rüdiger Reischuk:
    Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
    SIAM J. on Computing 15, 1986, 87-97.
  • Rüdiger Reischuk:
    A New Solution for the Byzantine Generals Problem
    Information and Control 64, 1985, 23-42.
  • Danny Dolev, Rüdiger Reischuk:
    Bounds on Information Exchange for Byzantine Agreement
    J. ACM 32, 1985, 191-204.
  • Rüdiger Reischuk:
    Probabilistic Parallel Algorithms for Sorting and Selection
    SIAM J. on Computing 14, 1985, 396-409.
  • Pavol Duris, Zvi Galil, Wolfgang Paul, Rüdiger Reischuk:
    Two Nonlinear Lower Bounds
    Information and Control 60, 1984, 1-11.
  • F. Chung, Robert Tarjan, Wolfgang Paul, Rüdiger Reischuk:
    Coding Strings by Pairs of Strings
    SIAM J. on Algebraic and Discrete Methods 63, 1983, 445-461.
  • Rüdiger Reischuk:
    A Fast Implementation of a Multidimensional Storage into a Tree Storage
    Theoretical Computer Science 19, 1982, 253-266.
  • Wolfgang Paul, Rüdiger Reischuk:
    On Time versus Space II
    J. Computer and System Sciences 22, 1981, 312-327.
  • Wolfgang Paul, Rüdiger Reischuk:
    On Alternation II - A Graph Theoretic Approach to Determinism versus Nondeterminism
    Acta Informatica 14, 1980, 391-403.
  • Wolfgang Paul und Ernst Prauss, Rüdiger Reischuk:
    On Alternation
    Acta Informatica 14, 1980, 243-255.
  • Rüdiger Reischuk:
    Improved Bounds on the Problem of Time-Space Trade-Offs in the Pebble Game
    J. ACM 27, 1980, 839-849.