50 Jahre Uni Lübeck

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

Veröffentlichungen


Zeitschriftenartikel

  • Wolfgang Paul, Rüdiger Reischuk:
    On Alternation II - A Graph Theoretic Approach to Determinism versus Nondeterminism.
    Acta Informatica, 4(14):391-403, 1980.
    Website anzeigen
  • Wolfgang Paul, Ernst Prauss, Rüdiger Reischuk:
    On Alternation.
    Acta Informatica, 3(14):243-255, 1980.
    Website anzeigen
  • Rüdiger Reischuk:
    Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game.
    Journal of the ACM, 4(27):839-849, 1980.
    Website anzeigen
  • Rüdiger Reischuk:
    A Fast Implementation of a Multidimensional Storage into a Tree Storage.
    Theoretical Computer Science, 3(19):253-266, 1982.
    Website anzeigen
  • Pavol Duri, Zvi Galil, Wolfgang Paul, Rüdiger Reischuk:
    Two Nonlinear Lower Bounds.
    Information and Control, 1-3(60):1-11, 1984.
    Website anzeigen
  • F.R.K. Chung, R.E. Tarjan, W.J. Paul, R. Reischuk:
    Coding Strings by Pairs of Strings.
    SIAM Journal on Matrix Analysis and Applications, 3(6):445-461, 1985.
    Website anzeigen
  • Danny Dolev, Rüdiger Reischuk:
    Bounds on Information Exchange for Byzantine Agreement.
    Journal of the ACM, 1(32):191-204, 1985.
    Website anzeigen
  • Rüdiger Reischuk:
    A New Solution for the Byzantine Generals Problem.
    Information and Control, 1-3(64):23-42, 1985.
    Website anzeigen
  • Rüdiger Reischuk:
    Probabilistic Parallel Algorithms for Sorting and Selection.
    SIAM Journal on Computing, 1(14):396-409, 1985.
    Website anzeigen
  • Steve Cook, Cynthia Dwork, Rüdiger Reischuk:
    Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes.
    SIAM Journal on Computing, 1(15):87-97, 1986.
    Website anzeigen
  • Rüdiger Reischuk:
    Simultaneous Writes of Parallel Random Access Machines Do not Help to Compute Simple Arithmetic Functions.
    Journal of the ACM, (34):163-178, 1987.
    Website anzeigen
  • Rüdiger Reischuk:
    Parallele Rechnermodelle und Komplexitätsklassen.
    Informationstechnik IT, (31):59-77, 1989.
  • Hagit Attiya, A. Bar-Noy, Danny Dolev, David Peleg, Rüdiger Reischuk:
    Renaming in an Asynchronous Environment.
    Journal of the ACM, 3(37):524-548, 1990.
    Website anzeigen
  • Danny Dolev, Rüdiger Reischuk, Ray Strong:
    Early Stopping in Byzantine Agreement.
    Journal of the ACM, 4(37):720-741, 1990.
    Website anzeigen
  • Bernd Halstenberg, Rüdiger Reischuk:
    Relations between Communication Complexity Classes.
    Journal of Computer and System Sciences, 3(41):402-429, 1990.
    Website anzeigen
  • Bernd Halstenberg, Rüdiger Reischuk:
    Different Modes of Communication.
    SIAM Journal on Computing, 5(22):913-934, 1993.
    Website anzeigen
  • Martin Dietzfelbinger, Mirek Kutylowski, Rüdiger Reischuk:
    Feasable Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines.
    SIAM Journal on Computing, 6(25):1196-1230, 1996.
    Website anzeigen
  • Maciej Liskiewicz, Rüdiger Reischuk:
    The Sublogarithmic Alternating Space World.
    SIAM Journal on Computing, 4(25):828-861, 1996.
    Website anzeigen
  • Rüdiger Reischuk, Christian Schindelhauer:
    An Average Complexity Measure that Yields Tight Hierarchies.
    Computational Complexity, 2(6):133-173, 1996.
    Website anzeigen
  • Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer:
    The Complexity of Broadcasting in Planar and Decomposable Graphs.
    Discrete Applied Mathematics, 1-3(83):179-206, 1998.
    Website anzeigen | Zusammenfassung anzeigen
  • Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer:
    Malign Distributions for Average Case Circuit Complexity.
    Information and Computation, 2(150):187-208, 1999.
    Website anzeigen
  • Maciej Liskiewicz, Rüdiger Reischuk:
    On Small Space Complexity Classes of Stochastic Turing Machines and Arthur-Merlin-Games.
    Computational Complexity, 3(8):273-307, 1999.
    Website anzeigen
  • Rüdiger Reischuk, Thomas Zeugmann:
    An Average-Case Optimal One-Variable Pattern Language Learner.
    Journal of Computer and System Sciences, 2(60):302-335, 2000.
    Website anzeigen
  • Rüdiger Reischuk:
    Can Large Fanin Circuits Perform Reliable Computations in the Presence of Faults?
    Theoretical Computer Science, 2(240):319-335, 2000.
    Website anzeigen
  • Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
    Approximating Schedules for Dynamic Graphs Efficiently.
    Journal of Discrete Algorithms, 4(2):471-500, 2004.
    Website anzeigen
  • Bodo Manthey, Rüdiger Reischuk:
    The Intractability of Computing the Hamming Distance.
    Theoretical Computer Science, 1-3(337):331-346, 2005.
    Website anzeigen
  • John Case, Sanjey Jain, Rüdiger Reischuk, Thomas Zeugmann:
    Learning a Subclass of Regular Patterns in Polynomial Time.
    Theoretical Computer Science, 1(364):115-131, 2006.
    Website anzeigen
  • Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
    Space Efficient Algorithms for Directed Series-Parallel Graphs.
    Journal of Algorithms, 2(60):85-114, 2006.
    Website anzeigen
  • Jan Arpe, Rüdiger Reischuk:
    Learning Juntas in the Presence of Noise.
    Theoretical Computer Science, 1(384):2-21, 2007.
    Website anzeigen
  • Bodo Manthey, Rüdiger Reischuk:
    Smoothed Analysis of Binary Search Trees.
    Theoretical Computer Science, 378(3):292-315, 2007.
    Website anzeigen | Zusammenfassung anzeigen
  • Wolfgang Bein, Lawrence L. Larmore, Rüdiger Reischuk:
    Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems.
    International Journal of Foundations of Computer Science, 20(1):167-184, 2009.
    Website anzeigen
  • Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer:
    Improving the Average Delay of Sorting.
    Theoretical Computer Science, 410(11):1030-1041, 2009.
    Website anzeigen
  • Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk:
    Proper Learning of k-term DNF Formulas from Satisfying Assignments.
    Journal of Computer and System Sciences, 2019 (noch nicht erschienen).
  • Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk:
    Learning Residual Alternating Automata.
    Electronic Colloquium on Computational Complexity (ECCC), 24(46)2017.
    Website anzeigen | Zusammenfassung anzeigen
  • Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk:
    Proper Learning of k-term DNF Formulas from Satisfying Assignments.
    Electronic Colloquium on Computational Complexity (ECCC), 24(114)2017.
    Website anzeigen | Zusammenfassung anzeigen
  • Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel:
    Security levels in steganography - Insecurity does not imply detectability.
    Theoret. Comput. Sci., (692):25-45, 2017.
    Website anzeigen
  • Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel:
    Security Levels in Steganography - Insecurity does not Imply Detectability.
    Electronic Colloquium on Computational Complexity (ECCC), 22(10)2015.
    Website anzeigen | Zusammenfassung anzeigen
  • Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel:
    Grey-box steganography.
    Theoretical Computer Science, (505):27-41, 2013.
    Website anzeigen