| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Wolfgang W. Bein, Lawrence L. Larmore, John Noga, Rüdiger Reischuk |
Knowledge State Algorithms.  |
Algorithmica  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Michal Koucký, Rüdiger Reischuk, Dieter van Melkebeek |
Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121). |
Dagstuhl Reports |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner (eds.) |
Algorithms Unplugged |
|
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rüdiger Reischuk, Markus Hinkelmann |
One-Way Functions - Mind the Trap - Escape Only for the Initiated. |
Algorithms Unplugged |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel |
Grey-Box Steganography. |
TAMC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rüdiger Reischuk, Johannes Textor |
Stochastic Search with Locally Clustered Targets: Learning from T Cells. |
ICARIS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer |
Improving the average delay of sorting. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk |
Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems. |
Int. J. Found. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Fischer, Erik Maehle, Rüdiger Reischuk (eds.) |
Informatik 2009: Im Focus das Leben, Beiträge der 39. Jahrestagung der Gesellschaft für Informatik e.V. (GI), 28.9.-2.10.2009, Lübeck, Proceedings |
GI Jahrestagung |
2009 |
DBLP BibTeX RDF |
|
| 1 | Rüdiger Reischuk, Markus Hinkelmann |
Einweg-Funktionen: Vorsicht Falle - Rückweg nur für Eingeweihte!. |
Taschenbuch der Algorithmen |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner (eds.) |
Taschenbuch der Algorithmen |
|
2008 |
DBLP BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk |
Knowledge States: A Tool for Randomized Online Algorithms. |
HICSS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Bodo Manthey, Rüdiger Reischuk |
Smoothed analysis of binary search trees. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Arpe, Rüdiger Reischuk |
Learning juntas in the presence of noise. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk |
Knowledge State Algorithms: Randomization with Limited Information |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Maciej Liskiewicz, Rüdiger Reischuk |
Preface. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer |
Improving the Average Delay of Sorting. |
TAMC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Arpe, Rüdiger Reischuk |
When Does Greedy Learning of Relevant Attributes Succeed? |
COCOON |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Arpe, Rüdiger Reischuk |
When Does Greedy Learning of Relevant Features Succeed? --- A Fourier-based Characterization ---. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann |
Learning a subclass of regular patterns in polynomial time. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolò Cesa-Bianchi, Rüdiger Reischuk, Thomas Zeugmann |
Foreword. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk |
Space efficient algorithms for directed series-parallel graphs. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Arpe, Rüdiger Reischuk |
Learning Juntas in the Presence of Noise. |
TAMC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek (eds.) |
Complexity of Boolean Functions, 12.03. - 17.03.2006 |
Complexity of Boolean Functions |
2006 |
DBLP BibTeX RDF |
|
| 1 | Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek |
06111 Abstracts Collection -- Complexity of Boolean Functions. |
Complexity of Boolean Functions |
2006 |
DBLP BibTeX RDF |
|
| 1 | Matthias Krause, Dieter van Melkebeek, Pavel Pudlák, Rüdiger Reischuk |
06111 Executive Summary -- Complexity of Boolean Functions. |
Complexity of Boolean Functions |
2006 |
DBLP BibTeX RDF |
|
| 1 | Jan Arpe, Rüdiger Reischuk |
On the Complexity of Optimal Grammar-Based Compression. |
DCC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Bodo Manthey, Rüdiger Reischuk |
Smoothed Analysis of the Height of Binary Search Trees |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Bodo Manthey, Rüdiger Reischuk |
The intractability of computing the Hamming distance. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Maciej Liskiewicz, Rüdiger Reischuk (eds.) |
Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings |
FCT |
2005 |
DBLP BibTeX RDF |
|
| 1 | Bodo Manthey, Rüdiger Reischuk |
Smoothed Analysis of Binary Search Trees. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann |
A Polynomial Time Learner for a Subclass of Regular Patterns |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk |
Approximating schedules for dynamic process graphs efficiently. |
J. Discrete Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk |
Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems. |
ISPAN |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk |
Private Computations in Networks: Topology versus Randomness. |
STACS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Arpe, Rüdiger Reischuk |
Robust Inference of Relevant Attributes. |
ALT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann |
Learning a Subclass of Regular Patterns in Polynomial Time. |
ALT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Bodo Manthey, Rüdiger Reischuk |
The Intractability of Computing the Hamming Distance. |
ISAAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk |
Space Efficient Algorithms for Directed Series-Parallel Graphs |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Nicolò Cesa-Bianchi, Masayuki Numao, Rüdiger Reischuk (eds.) |
Algorithmic Learning Theory, 13th International Conference, ALT 2002, Lübeck, Germany, November 24-26, 2002, Proceedings |
ALT |
2002 |
DBLP BibTeX RDF |
|
| 1 | Nicolò Cesa-Bianchi, Masayuki Numao, Rüdiger Reischuk |
Editors' Introduction. |
ALT |
2002 |
DBLP BibTeX RDF |
|
| 1 | Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk |
Dynamic Process Graphs and the Complexity of Scheduling |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Rüdiger Reischuk |
Approximating Schedules for Dynamic Graphs Efficiently |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk |
Space Efficient Algorithms for Series-Parallel Graphs. |
STACS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Rüdiger Reischuk |
Can large fanin circuits perform reliable computations in the presence of faults? |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Rüdiger Reischuk, Thomas Zeugmann |
An Average-Case Optimal One-Variable Pattern Language Learner. |
J. Comput. Syst. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk |
The Expressive Power and Complexity of Dynamic Process Graphs. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Weis, Rüdiger Reischuk |
The Complexity of Physical Mapping with Strict Chimerism. |
COCOON |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Rüdiger Reischuk |
Average Case Complexity of Unbounded Fanin Circuits. (PDF / PS) |
IEEE Conference on Computational Complexity |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer |
Malign Distributions for Average Case Circuit Complexity. |
Inf. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Maciej Liskiewicz, Rüdiger Reischuk |
On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games. |
Computational Complexity |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk |
Scheduling Dynamic Graphs. |
STACS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Rüdiger Reischuk, Thomas Zeugmann |
A Complete and Tight Average-Case Analysis of Learning Monomials. |
STACS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Rüdiger Reischuk |
Can Large Fanin Circuits Perform Reliable Computations in the Presence of Noise? |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Rüdiger Reischuk, Thomas Zeugmann |
An Average-Case Optimal One-Variable Pattern Language Learner |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer |
The complexity of broadcasting in planar and decomposable graphs. |
Discrete Applied Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Rüdiger Reischuk, Thomas Zeugmann |
Learning One-Variable Pattern Languages in Linear Average Time. |
COLT |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Dolev, Rüdiger Reischuk, Fred B. Schneider, H. Raymond Strong |
Report Dagstuhl Seminar on Time Services, Schloß Dagstuhl, March 11-15, 1996. |
Real-Time Systems |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Rüdiger Reischuk, Christian Schindelhauer |
An Average Complexity Measure that Yields Tight Hierarchies. |
Computational Complexity |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Maciej Liskiewicz, Rüdiger Reischuk |
Computational Limitations of Stochastic Turing Machines and Arthur-Merlin Games with Small Space Bounds. |
MFCS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Rüdiger Reischuk, Michel Morvan (eds.) |
STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997, Proceedings |
STACS |
1997 |
DBLP BibTeX RDF |
|
| 1 | Rüdiger Reischuk |
Can Large Fanin Circuits Perform Reliable Computations in the Presence of Noise ? |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk |
Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines. |
SIAM J. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Maciej Liskiewicz, Rüdiger Reischuk |
The Sublogarithmic Alternating Space World. |
SIAM J. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Claude Puech, Rüdiger Reischuk (eds.) |
STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings |
STACS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Maciej Liskiewicz, Rüdiger Reischuk |
The Sublogarithmic Alternating Space World |
Electronic Colloquium on Computational Complexity (ECCC) |
1995 |
DBLP BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk |
Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write PRAMs |
Electronic Colloquium on Computational Complexity (ECCC) |
1995 |
DBLP BibTeX RDF |
|
| 1 | Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer |
Malign Distributions for Average Case Circuit Complexity. |
STACS |
1995 |
DBLP DOI BibTeX RDF |
delay, distribution, circuit complexity, average case complexity |
| 1 | Andreas Jakoby, Rüdiger Reischuk |
Data Transmission in Processor Networks. |
WDAG |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk |
Exact Lower Time Bounds for Computing Boolean Functions on CREW PRAMs. |
J. Comput. Syst. Sci. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer |
The Complexity of Broadcasting in Planar and Decomposable Graphs. |
WG |
1994 |
DBLP DOI BibTeX RDF |
Classification graph algorithms, computational complexity, graph decomposition |
| 1 | Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer, Stephan Weis |
The Average Case Complexity of the Parallel Prefix Problem. |
ICALP |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Dolev, Rüdiger Reischuk, H. Raymond Strong |
Observable Clock Synchronization (Extended Abstract). |
PODC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Maciej Liskiewicz, Rüdiger Reischuk |
The Complexity World below Logarithmic Space. |
Structure in Complexity Theory Conference |
1994 |
DBLP BibTeX RDF |
|
| 1 | Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer |
Circuit complexity: from the worst case to the average case. |
STOC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernd Halstenberg, Rüdiger Reischuk |
Different Modes of Communication. |
SIAM J. Comput. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Maciej Liskiewicz, Rüdiger Reischuk |
Separating the Lower Levels of the Sublogarithmic Space Hierarchy. |
STACS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Rüdiger Reischuk, Christian Schindelhauer |
Precise Average Case Complexity. |
STACS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Rüdiger Reischuk |
The Complexity of Scheduling Problems with Communication Delays for Trees. |
SWAT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Rüdiger Reischuk, Bernd Schmeltz |
Area Efficient Methods to Increase the Reliability of Circuits. |
Data Structures and Efficient Algorithms |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Rüdiger Reischuk |
Graph Theoretical Methods for the Design of Parallel Algorithms. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Rüdiger Reischuk, Bernd Schmeltz |
Reliable Computation with Noisy Circuits and Decision Trees-A General n log n Lower Bound |
FOCS |
1991 |
DBLP DOI BibTeX RDF |
noisy decision tree complexity, tree depth, noisy circuits, critical number, static Boolean decision trees, erroneous answers, noisy dynamic decision trees, lower bound, Boolean functions, computational model, Boolean circuits, questions, answers |
| 1 | Hagit Attiya, Amotz Bar-Noy, Danny Dolev, David Peleg, Rüdiger Reischuk |
Renaming in an Asynchronous Environment |
J. ACM |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Dolev, Rüdiger Reischuk, H. Raymond Strong |
Early Stopping in Byzantine Agreement |
J. ACM |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernd Halstenberg, Rüdiger Reischuk |
Relations between Communication Complexity Classes. |
J. Comput. Syst. Sci. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Rüdiger Reischuk |
Einführung in die Komplexitätstheorie |
|
1990 |
RDF |
|
| 1 | Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk |
Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous Writes. |
SPAA |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Rüdiger Reischuk, Bernd Schmeltz |
Area Efficient Methods to Increase the Reliability of Combinatorial Circuits. |
STACS |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernd Halstenberg, Rüdiger Reischuk |
On Different Modes of Communication (Extended Abstract) |
STOC |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Rüdiger Reischuk |
Simultaneous WRITES of parallel random access machines do not help to compute simple arithmetic functions. |
J. ACM |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Rüdiger Reischuk, Meinolf Koshors |
Lower Bounds for Synchronous Networks and the Advantage of Local Information. |
WDAG |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Rüdiger Reischuk |
Konsistenz und Fehlertoleranz in Verteilten Systemen - Das Problem der Byzantinischen Generäle. |
GI Jahrestagung |
1987 |
DBLP BibTeX RDF |
|
| 1 | Hagit Attiya, Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg, Rüdiger Reischuk |
Achievable Cases in an Asynchronous Environment (Extended Abstract) |
FOCS |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook, Cynthia Dwork, Rüdiger Reischuk |
Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes. |
SIAM J. Comput. |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Rüdiger Reischuk |
Parallel Machines and their Communication Theoretical Limits. |
STACS |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Rüdiger Reischuk |
A New Solution for the Byzantine Generals Problem |
Information and Control |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Dolev, Rüdiger Reischuk |
Bounds on Information Exchange for Byzantine Agreement |
J. ACM |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Rüdiger Reischuk |
Probabilistic Parallel Algorithms for Sorting and Selection. |
SIAM J. Comput. |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Zvi Galil, Wolfgang J. Paul, Rüdiger Reischuk |
Two Nonlinear Lower Bounds for On-Line Computations |
Information and Control |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedhelm Meyer auf der Heide, Rüdiger Reischuk |
On the Limits to Speed Up Parallel Machines by Large Hardware and Unbounded Communication |
FOCS |
1984 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")