Rüdiger Reischuk

Rüdiger Reischuk, Lawrence L. Larmore, Wolfgang W. Bein, 2004, 7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings..

Bounds on information exchange for Byzantine agreement

Danny Dolev, Rüdiger Reischuk, D. Dolev, 1985, JACM.

Knowledge State Algorithms

Rüdiger Reischuk, Lawrence L. Larmore, Wolfgang W. Bein, 2011, Algorithmica.

Separating the Lower Levels of the Sublogarithmic Space Hierarchy

Maciej Liskiewicz, Rüdiger Reischuk, R. Reischuk, 1993, STACS.

Fundamentals of Computation Theory: 15th International Symposium, FCT 2005, Lübeck, Gemany, August 17-20, 2005, Proceedings (Lecture Notes in Computer Science)

Maciej Liskiewicz, Rüdiger Reischuk, 2005 .

Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes

Stephen A. Cook, Rüdiger Reischuk, Cynthia Dwork, 1986, SIAM J. Comput..

Proper Learning of k-term DNF Formulas from Satisfying Assignments

Maciej Liskiewicz, Rüdiger Reischuk, Matthias Lutter, 2019, Electron. Colloquium Comput. Complex..

An Average-Case Optimal One-Variable Pattern Language Learner

Rüdiger Reischuk, Thomas Zeugmann, 2000, J. Comput. Syst. Sci..

Observable clock synchronization extended abstract

Danny Dolev, Rüdiger Reischuk, H. Raymond Strong, 1994, PODC '94.

Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121)

Rüdiger Reischuk, Anna Gál, Michal Koucký, 2014, Dagstuhl Reports.

Private Computations in Networks: Topology versus Randomness

Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, 2003, STACS.

Improving Anonymization Clustering

Rüdiger Reischuk, Florian Thaeter, 2018, Sicherheit.

On the complexity of optimal grammar-based compression

Rüdiger Reischuk, Jan Arpe, 2006, Data Compression Conference (DCC'06).

The complexity of broadcasting in planar and decomposable graphs

Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer, 1998, Discret. Appl. Math..

Editors' Introduction

Masayuki Numao, Nicolò Cesa-Bianchi, Rüdiger Reischuk, 2002, ALT.

Support-Vektor-Lernen.

Bernhard Schölkopf, Rüdiger Reischuk, Steffen Hölldobler, 1998 .

Konsistenz und Fehlertoleranz in Verteilten Systemen - Das Problem der Byzantinischen Generäle

Rüdiger Reischuk, 1987, GI Jahrestagung.

Improving the Average Delay of Sorting

Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, 2007, TAMC.

Ausgezeichnete Informatikdissertationen 2016

Gustaf Neumann, Wolfgang Effelsberg, Myra Spiliopoulou, 2017, Ausgezeichnete Informatikdissertationen.

Graph Theoretical Methods for the Design of Parallel Algorithms

Rüdiger Reischuk, R. Reischuk, 1991, FCT.

The Complexity of Scheduling Problems with Communication Delays for Trees

Andreas Jakoby, Rüdiger Reischuk, 1992, SWAT.

06111 Abstracts Collection -- Complexity of Boolean Functions

Dieter van Melkebeek, Pavel Pudlák, Rüdiger Reischuk, 2006, Complexity of Boolean Functions.

Simultaneous WRITES of parallel random access machines do not help to compute simple arithmetic functions

Rüdiger Reischuk, 1987, JACM.

Scheduling Trees with Communication Delays

Andreas Jakoby, Rüdiger Reischuk, 1997 .

A New Solution for the Byzantine Generals Problem (Extended Abstract)

Rüdiger Reischuk, 1983, FCT.

Malign Distributions for Average Case Circuit Complexity

Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer, 1995, STACS.

On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games

Maciej Liskiewicz, Rüdiger Reischuk, 1999, computational complexity.

Learning Residual Alternating Automata

Maciej Liskiewicz, Sebastian Berndt, Rüdiger Reischuk, 2017, AAAI.

The Average Case Complexity of the Parallel Prefix Problem

Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer, 1994, ICALP.

o n A 1 t ern a t ion (preliminary version)

Wolfgang J. Paul, Rüdiger Reischuk, Ernst J. Praub, 1978 .

Algorithmic learning theory : 13th international conference, ALT 2002, Lübeck, Germany, November 24-26, 2002 : proceedings

Masayuki Numao, Nicolò Cesa-Bianchi, Rüdiger Reischuk, 2002 .

On time versus space II

Wolfgang J. Paul, Rüdiger Reischuk, 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

Robust Inference of Relevant Attributes

Rüdiger Reischuk, Jan Arpe, 2003, ALT.

Ausgezeichnete Informatikdissertationen 2013

Gustaf Neumann, Wolfgang Effelsberg, Myra Spiliopoulou, 2014, Ausgezeichnete Informatikdissertationen.

Exact Lower Time Bounds for Computing Boolean Functions on CREW PRAMs

Rüdiger Reischuk, Miroslaw Kutylowski, Martin Dietzfelbinger, 1994, J. Comput. Syst. Sci..

One-Way Functions - Mind the Trap - Escape Only for the Initiated

Rüdiger Reischuk, Markus Hinkelmann, 2011, Algorithms Unplugged.

Ausgezeichnete Informatikdissertationen 1996

Wolfgang Bibel, Rüdiger Reischuk, Friedrich Roithmayr, 1998 .

A "Fast Implementation" of a Multidimensional Storage into a Tree Storage

Rüdiger Reischuk, 1980, ICALP.

Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines

Rüdiger Reischuk, Miroslaw Kutylowski, Martin Dietzfelbinger, 1996, SIAM J. Comput..

'Eventual' is earlier than 'immediate'

Danny Dolev, Rüdiger Reischuk, H. Raymond Strong, 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

Taschenbuch der Algorithmen

Christian Scheideler, Heribert Vollmer, Berthold Vöcking, 2008, eXamen.press.

Grey-box steganography

Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel, 2013, Theor. Comput. Sci..

Analyzing the Average-Case Bahavior of Conjunctive Learning Algorithms (Models of Computation and Algorithms)

Rüdiger Reischuk, Thomas Zeugmann, 1999 .

Different Modes of Communication

Rüdiger Reischuk, Bernd Halstenberg, R. Reischuk, 1993, SIAM J. Comput..

Reliable computation with noisy circuits and decision trees-a general n log n lower bound

Rüdiger Reischuk, Bernd Schmeltz, R. Reischuk, 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

When Does Greedy Learning of Relevant Features Succeed? --- A Fourier-based Characterization ---

Rüdiger Reischuk, Jan Arpe, R. Reischuk, 2006, Electron. Colloquium Comput. Complex..

A Complete and Tight Average-Case Analysis of Learning Monomials

Rüdiger Reischuk, Thomas Zeugmann, R. Reischuk, 1999, STACS.

On Alternation (Preliminary Version)

Wolfgang J. Paul, Rüdiger Reischuk, Ernst-Jürgen Prauß, 1978, FOCS.

A Fast Implementation of a Multidimensional Storage Into a Tree Storage

Rüdiger Reischuk, 1982, Theor. Comput. Sci..

Malign Distributions for Average Case Circuit Complexity

Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer, 1999, Inf. Comput..

A fast probabilistic parallel sorting algorithm

Rüdiger Reischuk, R. Reischuk, 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

Approximating Schedules for Dynamic Graphs Efficiently

Rüdiger Reischuk, 2001, Electron. Colloquium Comput. Complex..

Achievable cases in an asynchronous environment

Hagit Attiya, Danny Dolev, David Peleg, 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

The Expressive Power and Complexity of Dynamic Process Graphs

Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, 2000, WG.

On Different Modes of Communication (Extended Abstract)

Rüdiger Reischuk, Bernd Halstenberg, 1988, STOC 1988.

Lower Bounds for Synchronous Networks and the Advantage of Local Information

Rüdiger Reischuk, Meinolf Koshors, R. Reischuk, 1987, WDAG.

Relations between Communication Complexity Classes

Rüdiger Reischuk, Bernd Halstenberg, R. Reischuk, 1990, J. Comput. Syst. Sci..

On alternation II

Wolfgang J. Paul, Rüdiger Reischuk, 2004, Acta Informatica.

Smoothed Analysis of the Height of Binary Search Trees

Rüdiger Reischuk, Bodo Manthey, 2005, Electron. Colloquium Comput. Complex..

Space Efficient Algorithms for Series-Parallel Graphs

Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, 2001, STACS.

On the Limits to Speed Up Parallel Machines by Large Hardware and Unbounded Communication

Friedhelm Meyer auf der Heide, Rüdiger Reischuk, R. Reischuk, 1984, FOCS.

Parallele Maschinenmodelle und Komplexitätsklassen

Rüdiger Reischuk, 1989, it Inf. Technol..

06111 Executive Summary -- Complexity of Boolean Functions

Dieter van Melkebeek, Pavel Pudlák, Rüdiger Reischuk, 2006, Complexity of Boolean Functions.

Early stopping in Byzantine agreement

Danny Dolev, Rüdiger Reischuk, H. Raymond Strong, 1990, JACM.

Learning a subclass of regular patterns in polynomial time

John Case, Sanjay Jain, Rüdiger Reischuk, 2006, Theor. Comput. Sci..

When Does Greedy Learning of Relevant Attributes Succeed?

Rüdiger Reischuk, Jan Arpe, R. Reischuk, 2007, COCOON.

Beziehungen zwischen Rechenzeit, Speicherplatz und Speicherstruktur

Rüdiger Reischuk, 1979 .

Area Efficient Methods to Increase the Reliability of Combinatorial Circuits

Rüdiger Reischuk, Bernd Schmeltz, 1989, STACS.

Einweg-Funktionen: Vorsicht Falle - Rückweg nur für Eingeweihte!

Rüdiger Reischuk, Markus Hinkelmann, 2008, Taschenbuch der Algorithmen.

Proceedings of the 13th International Conference on Algorithmic Learning Theory

Masayuki Numao, Rüdiger Reischuk, Nicolò Cesa-Bianchi, 2002 .

Area Efficient Methods to Increase the Reliability of Circuits

Rüdiger Reischuk, Bernd Schmeltz, 1992, Data Structures and Efficient Algorithms.

Learning juntas in the presence of noise

Rüdiger Reischuk, Jan Arpe, R. Reischuk, 2006, Theor. Comput. Sci..

Average case complexity of unbounded fanin circuits

Andreas Jakoby, Rüdiger Reischuk, 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.

Analysing Data Access Strategies in Cache Coherent Architectures

Rüdiger Reischuk, Karin Genther, 1999 .

Smoothed Analysis of Binary Search Trees

Rüdiger Reischuk, Bodo Manthey, 2005, ISAAC.

On different modes of communication

Rüdiger Reischuk, Bernd Halstenberg, 1988, STOC '88.

Proceedings of the 15th international conference on Fundamentals of Computation Theory

Rüdiger Reischuk, Maciej Liśkiewicz, 2005 .

Renaming in an asynchronous environment

Hagit Attiya, Danny Dolev, David Peleg, 1990, JACM.

Dynamic Process Graphs and the Complexity of Scheduling

Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, 2001, Electron. Colloquium Comput. Complex..

Grey-Box Steganography

Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel, 2011, TAMC.

Two nonlinear lower bounds

Wolfgang J. Paul, Zvi Galil, Rüdiger Reischuk, 1983, STOC '83.

Smoothed analysis of binary search trees

Rüdiger Reischuk, Bodo Manthey, 2007, Theor. Comput. Sci..

A Decentralized High Performance Time Service Architecture

Danny Dolev, Rüdiger Reischuk, Ray Strong, 1995 .

Data Transmission in Processor Networks

Andreas Jakoby, Rüdiger Reischuk, R. Reischuk, 1995, WDAG.

Parallel Machines and their Communication Theoretical Limits

Rüdiger Reischuk, 1986, STACS.

STACS 97 : 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27-March 1, 1997 : proceedings

Rüdiger Reischuk, Michel Morvan, 1997 .

Algorithmic Learning Theory

Masayuki Numao, Rüdiger Reischuk, Nicolò Cesa-Bianchi, 2002, Lecture Notes in Computer Science.

Approximating schedules for dynamic process graphs efficiently

Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, 2004, J. Discrete Algorithms.

Ausgezeichnete Informatikdissertationen 2012

Gustaf Neumann, Wolfgang Effelsberg, Myra Spiliopoulou, 2012, Ausgezeichnete Informatikdissertationen.

Two Nonlinear Lower Bounds for On-Line Computations

Wolfgang J. Paul, Zvi Galil, Rüdiger Reischuk, 1984, Inf. Control..

Report Dagstuhl Seminar on Time Services Schloß Dagstuhl, March 11. – March 15. 1996

Danny Dolev, Rüdiger Reischuk, Fred B. Schneider, 2004, Real-Time Systems.

The Sublogarithmic Alternating Space World

Maciej Liskiewicz, Rüdiger Reischuk, R. Reischuk, 1996, SIAM J. Comput..

08381 Executive Summary - Computational Complexity of Discrete Problems

Peter Bro Miltersen, Dieter van Melkebeek, Rüdiger Reischuk, 2008, Computational Complexity of Discrete Problems.

Complexity and Realization of Boolean Functions (Dagstuhl Seminar 9235)

Rüdiger Reischuk, Dietmar Uhlig, 2021 .

Scalable k-anonymous Microaggregation: Exploiting the Tradeoff between Computational Complexity and Information Loss

Rüdiger Reischuk, Florian Thaeter, 2021, SECRYPT.

Complexity of Boolean Functions (Dagstuhl Seminar 02121)

Noam Nisan, Rüdiger Reischuk, Ingo Wegener, 2021 .

Hardness of k-anonymous microaggregation

Rüdiger Reischuk, Florian Thaeter, R. Reischuk, 2020, Discret. Appl. Math..