Rüdiger Reischuk

170 papers A* 17A 12B 17C 5Misc 3Journal 64Unranked 17

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Parallel Composition for Statistical Privacy. CoRR Dennis Breutigam, Rüdiger Reischuk
2025	J	`jnl`	Improving Statistical Privacy by Subsampling. CoRR Dennis Breutigam, Rüdiger Reischuk
2025	J	`jnl`	Statistical Privacy. CoRR Dennis Breutigam, Rüdiger Reischuk
2024	—	`book`	Ausgezeichnete Informatikdissertationen 2023. Rüdiger Reischuk, Sven Apel, Abraham Bernstein, Maike Buchin, Anna Förster, Felix C. Freiling, Jan Mendling, Gustaf Neumann, Kay Uwe Römer, Björn Scheuermann, Ingo Scholtes, Nicole Schweikardt, Klaus Wehrle
2023	—	`ed.`	Ausgezeichnete Informatikdissertationen 2022. Rüdiger Reischuk, Sven Apel, Abraham Bernstein, Felix C. Freiling, Hans-Peter Lenhof, Gustaf Neumann, Kay Uwe Römer, Björn Scheuermann, Nicole Schweikardt, Klaus Wehrle
2022	—	`ed.`	Ausgezeichnete Informatikdissertationen 2021. Steffen Hölldobler, Rüdiger Reischuk, Sven Apel, Abraham Bernstein, Felix C. Freiling, Hans-Peter Lenhof, Gustaf Neumann, Kay Uwe Römer, Björn Scheuermann, Nicole Schweikardt, Klaus Wehrle
2022	J	`jnl`	Dynamic Kernels for Hitting Sets and Set Packing. Algorithmica Max Bannach, Zacharias Heinrich, Rüdiger Reischuk, Till Tantau
2022	J	`jnl`	Learning residual alternating automata. Inf. Comput. Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk
2022	J	`jnl`	The kangaroo problem. Theor. Comput. Sci. Rüdiger Reischuk
2021	—	`book`	Ausgezeichnete Informatikdissertationen 2020. Ausgezeichnete Informatikdissertationen Steffen Hölldobler, Sven Apel, Abraham Bernstein, Felix C. Freiling, Hans-Peter Lenhof, Gustaf Neumann, Rüdiger Reischuk, Kay Uwe Römer, Björn Scheuermann, Nicole Schweikardt, Myra Spiliopoulou, Sabine Süsstrunk, Klaus Wehrle
2021	B	`conf`	Dynamic Kernels for Hitting Sets and Set Packing. IPEC Max Bannach, Zacharias Heinrich, Rüdiger Reischuk, Till Tantau
2021	J	`jnl`	Hardness of k-anonymous microaggregation. Discret. Appl. Math. Florian Thaeter, Rüdiger Reischuk
2021	—	`conf`	Improving Time Complexity and Utility of k-anonymous Microaggregation. ICETE (Selected Papers) Florian Thaeter, Rüdiger Reischuk
2021	C	`conf`	Scalable k-anonymous Microaggregation: Exploiting the Tradeoff between Computational Complexity and Information Loss. SECRYPT Florian Thaeter, Rüdiger Reischuk
2020	—	`book`	Ausgezeichnete Informatikdissertationen 2019. Steffen Hölldobler, Sven Apel, Abraham Bernstein, Felix C. Freiling, Hans-Peter Lenhof, Gustaf Neumann, Rüdiger Reischuk, Kay Uwe Römer, Björn Scheuermann, Nicole Schweikardt, Myra Spiliopoulou, Sabine Süsstrunk, Klaus Wehrle
2019	—	`book`	Ausgezeichnete Informatikdissertationen 2018. Ausgezeichnete Informatikdissertationen Sven Apel, Abraham Bernstein, Felix C. Freiling, Steffen Hölldobler, Hans-Peter Lenhof, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Björn Scheuermann, Nicole Schweikardt, Myra Spiliopoulou, Sabine Süsstrunk, Klaus Wehrle
2019	J	`jnl`	Dynamic Kernels for Hitting Sets and Set Packing. Electron. Colloquium Comput. Complex. Max Bannach, Zacharias Heinrich, Rüdiger Reischuk, Till Tantau
2019	J	`jnl`	Proper learning of J. Comput. Syst. Sci. Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk
2018	—	`book`	Ausgezeichnete Informatikdissertationen 2017 Ausgezeichnete Informatikdissertationen Sven Apel, Abraham Bernstein, Wolfgang Effelsberg, Felix C. Freiling, Steffen Hölldobler, Hans-Peter Lenhof, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Nicole Schweikardt, Björn Scheuermann, Myra Spiliopoulou, Sabine Süsstrunk
2018	—	`conf`	Improving Anonymization Clustering. Sicherheit Florian Thaeter, Rüdiger Reischuk
2017	—	`book`	Ausgezeichnete Informatikdissertationen 2016 Ausgezeichnete Informatikdissertationen Abraham Bernstein, Wolfgang Effelsberg, Felix C. Freiling, Steffen Hölldobler, Hans-Peter Lenhof, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Nicole Schweikardt, Myra Spiliopoulou, Sabine Süsstrunk
2017	A*	`conf`	Learning Residual Alternating Automata. AAAI Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk
2017	J	`jnl`	Learning Residual Alternating Automata. Electron. Colloquium Comput. Complex. Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk
2017	J	`jnl`	Proper Learning of k-term DNF Formulas from Satisfying Assignments. Electron. Colloquium Comput. Complex. Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk
2017	J	`jnl`	Security levels in steganography - Insecurity does not imply detectability. Theor. Comput. Sci. Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel
2016	—	`book`	Ausgezeichnete Informatikdissertationen 2015 Ausgezeichnete Informatikdissertationen Abraham Bernstein, Wolfgang Effelsberg, Felix C. Freiling, Steffen Hölldobler, Hans-Peter Lenhof, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Nicole Schweikardt, Myra Spiliopoulou, Harald Störrle, Sabine Süsstrunk
2016	C	`conf`	Steganography Based on Pattern Languages. LATA Sebastian Berndt, Rüdiger Reischuk
2015	B	`conf`	Algorithmic Learning for Steganography: Proper Learning of k-term DNF Formulas from Positive Samples. ISAAC Matthias Ernst, Maciej Liskiewicz, Rüdiger Reischuk
2015	—	`book`	Ausgezeichnete Informatikdissertationen 2014 Ausgezeichnete Informatikdissertationen Abraham Bernstein, Wolfgang Effelsberg, Felix C. Freiling, Steffen Hölldobler, Hans-Peter Lenhof, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Nicole Schweikardt, Myra Spiliopoulou, Harald Störrle, Sabine Süsstrunk
2015	J	`jnl`	Security Levels in Steganography - Insecurity does not Imply Detectability. Electron. Colloquium Comput. Complex. Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel
2014	—	`book`	Ausgezeichnete Informatikdissertationen 2013 Ausgezeichnete Informatikdissertationen Abraham Bernstein, Wolfgang Effelsberg, Steffen Hölldobler, Hans-Peter Lenhof, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Nicole Schweikardt, Myra Spiliopoulou, Harald Störrle, Sabine Süsstrunk
2014	J	`jnl`	Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121). Dagstuhl Reports Anna Gál, Michal Koucký, Oded Regev, Rüdiger Reischuk
2013	B	`ed.`	Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers WG Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk
2013	J	`jnl`	Grey-box steganography. Theor. Comput. Sci. Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel
2012	—	`book`	Ausgezeichnete Informatikdissertationen 2011 Ausgezeichnete Informatikdissertationen Abraham Bernstein, Steffen Hölldobler, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Myra Spiliopoulou, Harald Störrle, Dorothea Wagner
2012	—	`book`	Ausgezeichnete Informatikdissertationen 2012 Ausgezeichnete Informatikdissertationen Abraham Bernstein, Wolfgang Effelsberg, Steffen Hölldobler, Hans-Peter Lenhof, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Nicole Schweikardt, Myra Spiliopoulou, Harald Störrle, Sabine Süsstrunk
2011	—	`book`	Algorithms Unplugged Algorithms Unplugged Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner
2011	—	`book`	Ausgezeichnete Informatikdissertationen 2010 Ausgezeichnete Informatikdissertationen Abraham Bernstein, Steffen Hölldobler, Günter Hotz, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Dietmar Saupe, Myra Spiliopoulou, Harald Störrle, Dorothea Wagner
2011	J	`jnl`	Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121). Dagstuhl Reports Martin Grohe, Michal Koucký, Rüdiger Reischuk, Dieter van Melkebeek
2011	C	`conf`	Grey-Box Steganography. TAMC Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel
2011	J	`jnl`	Knowledge State Algorithms. Algorithmica Wolfgang W. Bein, Lawrence L. Larmore, John Noga, Rüdiger Reischuk
2011	—	`ch.`	One-Way Functions - Mind the Trap - Escape Only for the Initiated. Algorithms Unplugged Rüdiger Reischuk, Markus Hinkelmann
2011	—	`conf`	Stochastic Search with Locally Clustered Targets: Learning from T Cells. ICARIS Rüdiger Reischuk, Johannes Textor
2010	—	`book`	Ausgezeichnete Informatikdissertationen 2008 Ausgezeichnete Informatikdissertationen Abraham Bernstein, Thomas Dreier, Steffen Hölldobler, Günter Hotz, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Dietmar Saupe, Myra Spiliopoulou, Harald Störrle, Dorothea Wagner
2010	—	`book`	Ausgezeichnete Informatikdissertationen 2009 Ausgezeichnete Informatikdissertationen Abraham Bernstein, Steffen Hölldobler, Günter Hotz, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Dietmar Saupe, Myra Spiliopoulou, Harald Störrle, Dorothea Wagner
2009	—	`ed.`	39. Jahrestagung der Gesellschaft für Informatik, Im Focus das Leben, INFORMATIK 2009, Lübeck, Germany, September 28 - October 2, 2009, Proceedings GI Jahrestagung Stefan Fischer, Erik Maehle, Rüdiger Reischuk
2009	J	`jnl`	Improving the average delay of sorting. Theor. Comput. Sci. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer
2009	J	`jnl`	Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems. Int. J. Found. Comput. Sci. Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk
2008	—	`conf`	08381 Abstracts Collection - Computational Complexity of Discrete Problems. Computational Complexity of Discrete Problems Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, Dieter van Melkebeek
2008	—	`conf`	08381 Executive Summary - Computational Complexity of Discrete Problems. Computational Complexity of Discrete Problems Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, Dieter van Melkebeek
2008	—	`book`	Ausgezeichnete Informatikdissertationen 2007 Ausgezeichnete Informatikdissertationen Abraham Bernstein, Thomas Dreier, Steffen Hölldobler, Günter Hotz, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Dietmar Saupe, Myra Spiliopoulou, Harald Störrle, Dorothea Wagner
2008	—	`ed.`	Computational Complexity of Discrete Problems, 14.09. - 19.09.2008 Computational Complexity of Discrete Problems Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, Dieter van Melkebeek
2008	—	`ch.`	Einweg-Funktionen: Vorsicht Falle - Rückweg nur für Eingeweihte!. Taschenbuch der Algorithmen Rüdiger Reischuk, Markus Hinkelmann
2008	—	`conf`	Knowledge States: A Tool for Randomized Online Algorithms. HICSS Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk
2008	—	`book`	Taschenbuch der Algorithmen Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner
2007	C	`conf`	Improving the Average Delay of Sorting. TAMC Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer
2007	J	`jnl`	Knowledge State Algorithms: Randomization with Limited Information CoRR Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk
2007	J	`jnl`	Learning juntas in the presence of noise. Theor. Comput. Sci. Jan Arpe, Rüdiger Reischuk
2007	J	`jnl`	Preface. Theory Comput. Syst. Maciej Liskiewicz, Rüdiger Reischuk
2007	J	`jnl`	Smoothed analysis of binary search trees. Theor. Comput. Sci. Bodo Manthey, Rüdiger Reischuk
2007	Misc	`conf`	When Does Greedy Learning of Relevant Attributes Succeed? COCOON Jan Arpe, Rüdiger Reischuk
2006	—	`conf`	06111 Abstracts Collection -- Complexity of Boolean Functions. Complexity of Boolean Functions Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek
2006	—	`conf`	06111 Executive Summary -- Complexity of Boolean Functions. Complexity of Boolean Functions Matthias Krause, Dieter van Melkebeek, Pavel Pudlák, Rüdiger Reischuk
2006	—	`book`	Ausgezeichnete Informatikdissertationen 2005 Ausgezeichnete Informatikdissertationen Abraham Bernstein, Thomas Dreier, Steffen Hölldobler, Günter Hotz, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Dietmar Saupe, Myra Spiliopoulou, Dorothea Wagner
2006	—	`ed.`	Complexity of Boolean Functions, 12.03. - 17.03.2006 Complexity of Boolean Functions Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek
2006	J	`jnl`	Foreword. Theor. Comput. Sci. Nicolò Cesa-Bianchi, Rüdiger Reischuk, Thomas Zeugmann
2006	C	`conf`	Learning Juntas in the Presence of Noise. TAMC Jan Arpe, Rüdiger Reischuk
2006	J	`jnl`	Learning a subclass of regular patterns in polynomial time. Theor. Comput. Sci. John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann
2006	B	`conf`	On the Complexity of Optimal Grammar-Based Compression. DCC Jan Arpe, Rüdiger Reischuk
2006	J	`jnl`	Space efficient algorithms for directed series-parallel graphs. J. Algorithms Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
2006	J	`jnl`	When Does Greedy Learning of Relevant Features Succeed? --- A Fourier-based Characterization ---. Electron. Colloquium Comput. Complex. Jan Arpe, Rüdiger Reischuk
2005	—	`book`	Ausgezeichnete Informatikdissertationen 2004 Ausgezeichnete Informatikdissertationen Thomas Dreier, Oliver Günther, Steffen Hölldobler, Klaus-Peter Löhr, Paul Molitor, Rüdiger Reischuk, Dietmar Saupe, Dorothea Wagner
2005	B	`ed.`	Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings FCT Maciej Liskiewicz, Rüdiger Reischuk
2005	B	`conf`	Smoothed Analysis of Binary Search Trees. ISAAC Bodo Manthey, Rüdiger Reischuk
2005	J	`jnl`	Smoothed Analysis of the Height of Binary Search Trees Electron. Colloquium Comput. Complex. Bodo Manthey, Rüdiger Reischuk
2005	J	`jnl`	The intractability of computing the Hamming distance. Theor. Comput. Sci. Bodo Manthey, Rüdiger Reischuk
2004	J	`jnl`	A Polynomial Time Learner for a Subclass of Regular Patterns Electron. Colloquium Comput. Complex. John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann
2004	J	`jnl`	Approximating schedules for dynamic process graphs efficiently. J. Discrete Algorithms Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
2004	—	`book`	Ausgezeichnete Informatikdissertationen 2003 Ausgezeichnete Informatikdissertationen Heinz Beilner, Thomas Dreier, Markus Gross, Oliver Günther, Steffen Hölldobler, Klaus-Peter Löhr, Rüdiger Reischuk, Dorothea Wagner
2004	—	`conf`	Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems. ISPAN Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk
2003	B	`conf`	Learning a Subclass of Regular Patterns in Polynomial Time. ALT John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann
2003	A	`conf`	Private Computations in Networks: Topology versus Randomness. STACS Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
2003	B	`conf`	Robust Inference of Relevant Attributes. ALT Jan Arpe, Rüdiger Reischuk
2003	B	`conf`	The Intractability of Computing the Hamming Distance. ISAAC Bodo Manthey, Rüdiger Reischuk
2002	B	`ed.`	Algorithmic Learning Theory, 13th International Conference, ALT 2002, Lübeck, Germany, November 24-26, 2002, Proceedings ALT Nicolò Cesa-Bianchi, Masayuki Numao, Rüdiger Reischuk
2002	—	`book`	Ausgezeichnete Informatikdissertationen 2002 Ausgezeichnete Informatikdissertationen Heinz Beilner, Herbert Fiedler, Markus Gross, Oliver Günther, Steffen Hölldobler, Günter Hotz, Klaus-Peter Löhr, Rüdiger Reischuk, Dorothea Wagner
2002	B	`conf`	Editors' Introduction. ALT Nicolò Cesa-Bianchi, Masayuki Numao, Rüdiger Reischuk
2002	J	`jnl`	Space Efficient Algorithms for Directed Series-Parallel Graphs Electron. Colloquium Comput. Complex. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
2001	J	`jnl`	Approximating Schedules for Dynamic Graphs Efficiently Electron. Colloquium Comput. Complex. Rüdiger Reischuk
2001	—	`book`	Ausgezeichnete Informatikdissertationen 2001 Ausgezeichnete Informatikdissertationen Heinz Beilner, Herbert Fiedler, Oliver Günther, Steffen Hölldobler, Günter Hotz, Peter Liggesmeyer, Klaus-Peter Löhr, Rüdiger Reischuk, Dorothea Wagner
2001	J	`jnl`	Dynamic Process Graphs and the Complexity of Scheduling Electron. Colloquium Comput. Complex. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
2001	A	`conf`	Space Efficient Algorithms for Series-Parallel Graphs. STACS Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
2000	J	`jnl`	An Average-Case Optimal One-Variable Pattern Language Learner. J. Comput. Syst. Sci. Rüdiger Reischuk, Thomas Zeugmann
2000	—	`book`	Ausgezeichnete Informatikdissertationen 1999 Herbert Fiedler, Oliver Günther, Werner Grass, Steffen Hölldobler, Günter Hotz, Rüdiger Reischuk, Bernhard Seeger, Dorothea Wagner
2000	—	`book`	Ausgezeichnete Informatikdissertationen 2000 Ausgezeichnete Informatikdissertationen Herbert Fiedler, Werner Grass, Oliver Günther, Steffen Hölldobler, Günter Hotz, Rüdiger Reischuk, Bernhard Seeger, Dorothea Wagner
2000	A	`conf`	Average Case Complexity of Unbounded Fanin Circuits. CCC Andreas Jakoby, Rüdiger Reischuk
2000	J	`jnl`	Can large fanin circuits perform reliable computations in the presence of faults? Theor. Comput. Sci. Rüdiger Reischuk
2000	Misc	`conf`	The Complexity of Physical Mapping with Strict Chimerism. COCOON Stephan Weis, Rüdiger Reischuk
2000	B	`conf`	The Expressive Power and Complexity of Dynamic Process Graphs. WG Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
1999	A	`conf`	A Complete and Tight Average-Case Analysis of Learning Monomials. STACS Rüdiger Reischuk, Thomas Zeugmann
1999	J	`jnl`	Malign Distributions for Average Case Circuit Complexity. Inf. Comput. Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
1999	J	`jnl`	On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games. Comput. Complex. Maciej Liskiewicz, Rüdiger Reischuk
1999	A	`conf`	Scheduling Dynamic Graphs. STACS Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
1998	J	`jnl`	An Average-Case Optimal One-Variable Pattern Language Learner Electron. Colloquium Comput. Complex. Rüdiger Reischuk, Thomas Zeugmann
1998	—	`book`	Ausgezeichnete Informatikdissertationen 1996 Wolfgang Bibel, Herbert Fiedler, Werner Grass, Peter Gorny, Günter Hotz, Immo O. Kerner, Rüdiger Reischuk, Friedrich Roithmayr
1998	J	`jnl`	Can Large Fanin Circuits Perform Reliable Computations in the Presence of Noise? Electron. Colloquium Comput. Complex. Rüdiger Reischuk
1998	A*	`conf`	Learning One-Variable Pattern Languages in Linear Average Time. COLT Rüdiger Reischuk, Thomas Zeugmann
1998	J	`jnl`	The complexity of broadcasting in planar and decomposable graphs. Discret. Appl. Math. Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
1997	J	`jnl`	An Average Complexity Measure that Yields Tight Hierarchies. Comput. Complex. Rüdiger Reischuk, Christian Schindelhauer
1997	Misc	`conf`	Can Large Fanin Circuits Perform Reliable Computations in the Presence of Noise ? COCOON Rüdiger Reischuk
1997	B	`conf`	Computational Limitations of Stochastic Turing Machines and Arthur-Merlin Games with Small Space Bounds. MFCS Maciej Liskiewicz, Rüdiger Reischuk
1997	J	`jnl`	Report Dagstuhl Seminar on Time Services, Schloß Dagstuhl, March 11-15, 1996. Real Time Syst. Danny Dolev, Rüdiger Reischuk, Fred B. Schneider, H. Raymond Strong
1997	A	`ed.`	STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997, Proceedings STACS Rüdiger Reischuk, Michel Morvan
1996	J	`jnl`	Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines. SIAM J. Comput. Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk
1996	A	`ed.`	STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings STACS Claude Puech, Rüdiger Reischuk
1996	J	`jnl`	The Sublogarithmic Alternating Space World. SIAM J. Comput. Maciej Liskiewicz, Rüdiger Reischuk
1995	—	`conf`	Data Transmission in Processor Networks. WDAG Andreas Jakoby, Rüdiger Reischuk
1995	J	`jnl`	Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write PRAMs Electron. Colloquium Comput. Complex. Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk
1995	A	`conf`	Malign Distributions for Average Case Circuit Complexity. STACS Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
1995	J	`jnl`	The Sublogarithmic Alternating Space World Electron. Colloquium Comput. Complex. Maciej Liskiewicz, Rüdiger Reischuk
1994	A*	`conf`	Circuit complexity: from the worst case to the average case. STOC Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
1994	J	`jnl`	Exact Lower Time Bounds for Computing Boolean Functions on CREW PRAMs. J. Comput. Syst. Sci. Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk
1994	A*	`conf`	Observable Clock Synchronization (Extended Abstract). PODC Danny Dolev, Rüdiger Reischuk, H. Raymond Strong
1994	A*	`conf`	The Average Case Complexity of the Parallel Prefix Problem. ICALP Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer, Stephan Weis
1994	—	`conf`	The Complexity World below Logarithmic Space. SCT Maciej Liskiewicz, Rüdiger Reischuk
1994	B	`conf`	The Complexity of Broadcasting in Planar and Decomposable Graphs. WG Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
1993	J	`jnl`	Different Modes of Communication. SIAM J. Comput. Bernd Halstenberg, Rüdiger Reischuk
1993	A	`conf`	Precise Average Case Complexity. STACS Rüdiger Reischuk, Christian Schindelhauer
1993	A	`conf`	Separating the Lower Levels of the Sublogarithmic Space Hierarchy. STACS Maciej Liskiewicz, Rüdiger Reischuk
1992	—	`conf`	Area Efficient Methods to Increase the Reliability of Circuits. Data Structures and Efficient Algorithms Rüdiger Reischuk, Bernd Schmeltz
1992	—	`conf`	The Complexity of Scheduling Problems with Communication Delays for Trees. SWAT Andreas Jakoby, Rüdiger Reischuk
1992	—	`ch.`	Über den Nutzen von Orakelfragen bei nichtdeterministischen Kommunikationsprotokollen. Informatik Bernd Halstenberg, Rüdiger Reischuk
1991	B	`conf`	Graph Theoretical Methods for the Design of Parallel Algorithms. FCT Rüdiger Reischuk
1991	A*	`conf`	Reliable Computation with Noisy Circuits and Decision Trees-A General n log n Lower Bound FOCS Rüdiger Reischuk, Bernd Schmeltz
1990	J	`jnl`	Early Stopping in Byzantine Agreement J. ACM Danny Dolev, Rüdiger Reischuk, H. Raymond Strong
1990	—	`book`	Einführung in die Komplexitätstheorie Rüdiger Reischuk
1990	B	`conf`	Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous Writes. SPAA Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk
1990	J	`jnl`	Relations between Communication Complexity Classes. J. Comput. Syst. Sci. Bernd Halstenberg, Rüdiger Reischuk
1990	J	`jnl`	Renaming in an Asynchronous Environment J. ACM Hagit Attiya, Amotz Bar-Noy, Danny Dolev, David Peleg, Rüdiger Reischuk
1989	A	`conf`	Area Efficient Methods to Increase the Reliability of Combinatorial Circuits. STACS Rüdiger Reischuk, Bernd Schmeltz
1989	J	`jnl`	Parallele Maschinenmodelle und Komplexitätsklassen. it Inf. Technol. Rüdiger Reischuk
1988	A*	`conf`	On Different Modes of Communication (Extended Abstract) STOC Bernd Halstenberg, Rüdiger Reischuk
1988	—	`conf`	Relations between communication complexity classes. SCT Bernd Halstenberg, Rüdiger Reischuk
1987	A*	`conf`	Achievable Cases in an Asynchronous Environment (Extended Abstract) FOCS Hagit Attiya, Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg, Rüdiger Reischuk
1987	—	`conf`	Konsistenz und Fehlertoleranz in Verteilten Systemen - Das Problem der Byzantinischen Generäle. GI Jahrestagung Rüdiger Reischuk
1987	—	`conf`	Lower Bounds for Synchronous Networks and the Advantage of Local Information. WDAG Rüdiger Reischuk, Meinolf Koshors
1987	J	`jnl`	Simultaneous WRITES of parallel random access machines do not help to compute simple arithmetic functions. J. ACM Rüdiger Reischuk
1986	A	`conf`	Parallel Machines and their Communication Theoretical Limits. STACS Rüdiger Reischuk
1986	J	`jnl`	Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes. SIAM J. Comput. Stephen A. Cook, Cynthia Dwork, Rüdiger Reischuk
1985	J	`jnl`	A New Solution for the Byzantine Generals Problem Inf. Control. Rüdiger Reischuk
1985	J	`jnl`	Bounds on Information Exchange for Byzantine Agreement J. ACM Danny Dolev, Rüdiger Reischuk
1985	J	`jnl`	Probabilistic Parallel Algorithms for Sorting and Selection. SIAM J. Comput. Rüdiger Reischuk
1984	A*	`conf`	On the Limits to Speed Up Parallel Machines by Large Hardware and Unbounded Communication FOCS Friedhelm Meyer auf der Heide, Rüdiger Reischuk
1984	J	`jnl`	Two Nonlinear Lower Bounds for On-Line Computations Inf. Control. Pavol Duris, Zvi Galil, Wolfgang J. Paul, Rüdiger Reischuk
1983	B	`conf`	A New Solution for the Byzantine Generals Problem (Extended Abstract). FCT Rüdiger Reischuk
1983	A*	`conf`	Two Nonlinear Lower Bounds STOC Pavol Duris, Zvi Galil, Wolfgang J. Paul, Rüdiger Reischuk
1982	A*	`conf`	'Eventual' Is Earlier than 'Immediate' FOCS Danny Dolev, Rüdiger Reischuk, H. Raymond Strong
1982	J	`jnl`	A Fast Implementation of a Multidimensional Storage Into a Tree Storage. Theor. Comput. Sci. Rüdiger Reischuk
1982	A*	`conf`	Bounds on Information Exchange for Byzantine Agreement. PODC Danny Dolev, Rüdiger Reischuk
1981	A*	`conf`	A Fast Probabilistic Parallel Sorting Algorithm FOCS Rüdiger Reischuk
1981	J	`jnl`	On Time versus Space II. (Turing Machines). J. Comput. Syst. Sci. Wolfgang J. Paul, Rüdiger Reischuk
1980	A*	`conf`	A "Fast Implementation" of a Multidimensional Storage into a Tree Storage. ICALP Rüdiger Reischuk
1980	J	`jnl`	Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game. J. ACM Rüdiger Reischuk
1980	J	`jnl`	On Alternation II. A Graph Theoretic Approach to Determinism Versus Nondeterminism. Acta Informatica Wolfgang J. Paul, Rüdiger Reischuk
1980	J	`jnl`	On Alternation. Acta Informatica Wolfgang J. Paul, Ernst-Jürgen Prauß, Rüdiger Reischuk
1979	—	`conf`	A Graph Theoretic Approach to Determinism versus Non-Determinism. Theoretical Computer Science Wolfgang J. Paul, Rüdiger Reischuk
1979	—	`—`	Beziehungen zwischen Rechenzeit, Speicherplatz und Speicherstruktur. Rüdiger Reischuk
1979	A*	`conf`	On Time versus Space II FOCS Wolfgang J. Paul, Rüdiger Reischuk
1978	A*	`conf`	Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game (Preliminary Version) FOCS Rüdiger Reischuk
1978	A*	`conf`	On Alternation (Preliminary Version) FOCS Wolfgang J. Paul, Ernst-Jürgen Prauß, Rüdiger Reischuk