50 years Univerity of Lübeck

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

Publications


1989

  • Rüdiger Reischuk, Bernd Schmeltz:
    Area Efficient Methods to Increase the Reliability of Combinatorial Circuits.
    In 6. GI-AFCET Symposium on Theoretical Aspects of Computer Science STACS'89, Volume 349 of Lecture Notes in Computer Science, pp. 314-326. Springer, 1989.
    Go to website
  • Rüdiger Reischuk:
    Parallele Rechnermodelle und Komplexitätsklassen.
    Informationstechnik IT, (31):59-77, 1989.

1988

  • Bernd Halstenberg, Rüdiger Reischuk:
    Relations between Communication Complexity Classes.
    In 3. Ann. IEEE - SIGACT - EATCS Symposium on Structure in Complexity Theory STRUCTURES'88, pp. 19-28. IEEE Computer Society, 1988.

1987

  • Hagit Attiya, A. Bar-Noy, Danny Dolev, David Peleg, Rüdiger Reischuk:
    Achievable Cases in an Asynchronous Environment.
    In 28. Ann. Symposium on Foundations of Computer Science FOCS'87, pp. 337-346. IEEE Computer Society, 1987.
    Go to website
  • Meinolf Koshors, Rüdiger Reischuk:
    Lower Bounds for Synchronous Systems and the Advantage of Local Information.
    In 2. Int. Workshop on Distributed Algorithms WDAG'87, Volume 312 of Lecture Notes in Computer Science, pp. 374-387. Springer, 1987.
    Go to website
  • Rüdiger Reischuk:
    Konsistenz und Fehlertoleranz in Verteilten Systemen - Das Problem der Byzantinischen Generäle.
    In 17. GI Jahrestagung 1987, Volume 156 of Springer Informatik Fachberichte, pp. 65-81. Springer, 1987.
    Go to website
  • 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.
    Go to website

1986

  • 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.
    Go to website
  • Rüdiger Reischuk:
    Parallel Machines and their Communication Theoretical Limits.
    In 3. GI-AFCET Symposium on Theoretical Aspects of Computer Science STACS'86, Volume 210 of Lecture Notes in Computer Science, pp. 359-368. Springer, 1986.
    Go to website

1985

  • 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.
    Go to website
  • Danny Dolev, Rüdiger Reischuk:
    Bounds on Information Exchange for Byzantine Agreement.
    Journal of the ACM, 1(32):191-204, 1985.
    Go to website
  • Rüdiger Reischuk:
    A New Solution for the Byzantine Generals Problem.
    Information and Control, 1-3(64):23-42, 1985.
    Go to website
  • Rüdiger Reischuk:
    Probabilistic Parallel Algorithms for Sorting and Selection.
    SIAM Journal on Computing, 1(14):396-409, 1985.
    Go to website

1984

  • Pavol Duri, Zvi Galil, Wolfgang Paul, Rüdiger Reischuk:
    Two Nonlinear Lower Bounds.
    Information and Control, 1-3(60):1-11, 1984.
    Go to website
  • Friedhelm Meyer auf der Heide, Rüdiger Reischuk:
    On the Limits to Speed up Parallel Machines by Large Hardware and Unbounded Communication.
    In 25. Ann. IEEE Symposium on Foundations of Computer Science FOCS'84, pp. 56-64. IEEE Computer Society, 1984.
    Go to website

1983

  • Pavol Duris, Zvi Galil, Wolfgang Paul, Rüdiger Reischuk:
    Two Nonlinear Lower Bounds.
    In 15. ACM Symposium on Theory of Computing STOC'83, pp. 127-132. ACM Association for Computing Machinery, 1983.
    Go to website
  • Rüdiger Reischuk:
    A New Solution for the Byzantine Generals Problem.
    In 5. Int. Conference on Foundations of Computation Theory FCT'83, Volume 158 of Lecture Notes in Computer Science, pp. 382-393. Springer, 1983.
    Go to website

1982

  • Danny Dolev, Rüdiger Reischuk, Ray Strong:
    'Eventual' is Earlier than 'Immediate'.
    In 23. IEEE Ann. Symposium on Foundations of Computer Science FOCS'82, pp. 196-203. IEEE Computer Society, 1982.
    Go to website
  • Danny Dolev, Rüdiger Reischuk:
    Bounds on Information Exchange for Byzantine Agreement.
    In 1. ACM Symposium on Principles of Distributed Computing PODC'82, pp. 132-140. ACM Association for Computing Machinery, 1982.
    Go to website
  • Rüdiger Reischuk:
    A Fast Implementation of a Multidimensional Storage into a Tree Storage.
    Theoretical Computer Science, 3(19):253-266, 1982.
    Go to website

1981

  • Rüdiger Reischuk:
    Probabilistic Parallel Algorithms for Sorting and Selection.
    In 22. IEEE Ann. Symposium on Foundations of Computer Science FOCS'81, pp. 212-219. IEEE Computer Society, 1981.
    Go to website

1980

  • Wolfgang Paul, Rüdiger Reischuk:
    On Alternation II - A Graph Theoretic Approach to Determinism versus Nondeterminism.
    Acta Informatica, 4(14):391-403, 1980.
    Go to website
  • Wolfgang Paul, Ernst Prauss, Rüdiger Reischuk:
    On Alternation.
    Acta Informatica, 3(14):243-255, 1980.
    Go to website
  • Rüdiger Reischuk:
    A Fast Implementation of a Multidimensional Storage into a Tree Storage.
    In 7. EATCS International Colloquium on Automata Theory, Languages and Computation ICALP'80, Volume 85 of Lecture Notes in Computer Science, pp. 531-542. Springer, 1980.
    Go to website
  • 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.
    Go to website