The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Rüdiger Reischuk: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  94. 06111 Abstracts Collection -- Complexity of Boolean Functions. [Citation Graph (, )][DBLP]


  95. 06111 Executive Summary -- Complexity of Boolean Functions. [Citation Graph (, )][DBLP]


  96. Knowledge States: A Tool for Randomized Online Algorithms. [Citation Graph (, )][DBLP]


  97. When Does Greedy Learning of Relevant Features Succeed? --- A Fourier-based Characterization ---. [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.013secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002