Rüdiger Reischuk

According to our database1, Rüdiger Reischuk
  • authored at least 121 papers between 1978 and 2017.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Security levels in steganography - Insecurity does not imply detectability.
Theor. Comput. Sci., 2017

Proper Learning of k-term DNF Formulas from Satisfying Assignments.
Electronic Colloquium on Computational Complexity (ECCC), 2017

Learning Residual Alternating Automata.
Electronic Colloquium on Computational Complexity (ECCC), 2017

Learning Residual Alternating Automata.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Steganography Based on Pattern Languages.
Proceedings of the Language and Automata Theory and Applications, 2016

2015
Security Levels in Steganography - Insecurity does not Imply Detectability.
Electronic Colloquium on Computational Complexity (ECCC), 2015

Algorithmic Learning for Steganography: Proper Learning of k-term DNF Formulas from Positive Samples.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014
Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121).
Dagstuhl Reports, 2014

2013
Grey-box steganography.
Theor. Comput. Sci., 2013

2011
Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121).
Dagstuhl Reports, 2011

Knowledge State Algorithms.
Algorithmica, 2011

Grey-Box Steganography.
Proceedings of the Theory and Applications of Models of Computation, 2011

Stochastic Search with Locally Clustered Targets: Learning from T Cells.
Proceedings of the Artificial Immune Systems - 10th International Conference, 2011

One-Way Functions - Mind the Trap - Escape Only for the Initiated.
Proceedings of the Algorithms Unplugged, 2011

2009
Improving the average delay of sorting.
Theor. Comput. Sci., 2009

Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems.
Int. J. Found. Comput. Sci., 2009

2008
Einweg-Funktionen: Vorsicht Falle - Rückweg nur für Eingeweihte!.
Proceedings of the Taschenbuch der Algorithmen, 2008

Knowledge States: A Tool for Randomized Online Algorithms.
Proceedings of the 41st Hawaii International International Conference on Systems Science (HICSS-41 2008), 2008

08381 Executive Summary - Computational Complexity of Discrete Problems.
Proceedings of the Computational Complexity of Discrete Problems, 14.09. - 19.09.2008, 2008

08381 Abstracts Collection - Computational Complexity of Discrete Problems.
Proceedings of the Computational Complexity of Discrete Problems, 14.09. - 19.09.2008, 2008

2007
Smoothed analysis of binary search trees.
Theor. Comput. Sci., 2007

Learning juntas in the presence of noise.
Theor. Comput. Sci., 2007

Preface.
Theory Comput. Syst., 2007

Knowledge State Algorithms: Randomization with Limited Information
CoRR, 2007

Improving the Average Delay of Sorting.
Proceedings of the Theory and Applications of Models of Computation, 2007

When Does Greedy Learning of Relevant Attributes Succeed?
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006
Foreword.
Theor. Comput. Sci., 2006

Learning a subclass of regular patterns in polynomial time.
Theor. Comput. Sci., 2006

Space efficient algorithms for directed series-parallel graphs.
J. Algorithms, 2006

When Does Greedy Learning of Relevant Features Succeed? --- A Fourier-based Characterization ---.
Electronic Colloquium on Computational Complexity (ECCC), 2006

Learning Juntas in the Presence of Noise.
Proceedings of the Theory and Applications of Models of Computation, 2006

On the Complexity of Optimal Grammar-Based Compression.
Proceedings of the 2006 Data Compression Conference (DCC 2006), 2006

06111 Abstracts Collection -- Complexity of Boolean Functions.
Proceedings of the Complexity of Boolean Functions, 12.03. - 17.03.2006, 2006

06111 Executive Summary -- Complexity of Boolean Functions.
Proceedings of the Complexity of Boolean Functions, 12.03. - 17.03.2006, 2006

2005
The intractability of computing the Hamming distance.
Theor. Comput. Sci., 2005

Smoothed Analysis of the Height of Binary Search Trees
Electronic Colloquium on Computational Complexity (ECCC), 2005

Smoothed Analysis of Binary Search Trees.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004
Approximating schedules for dynamic process graphs efficiently.
J. Discrete Algorithms, 2004

A Polynomial Time Learner for a Subclass of Regular Patterns
Electronic Colloquium on Computational Complexity (ECCC), 2004

Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems.
Proceedings of the 7th International Symposium on Parallel Architectures, 2004

2003
Private Computations in Networks: Topology versus Randomness.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

The Intractability of Computing the Hamming Distance.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Learning a Subclass of Regular Patterns in Polynomial Time.
Proceedings of the Algorithmic Learning Theory, 14th International Conference, 2003

Robust Inference of Relevant Attributes.
Proceedings of the Algorithmic Learning Theory, 14th International Conference, 2003

2002
Space Efficient Algorithms for Directed Series-Parallel Graphs
Electronic Colloquium on Computational Complexity (ECCC), 2002

Editors' Introduction.
Proceedings of the Algorithmic Learning Theory, 13th International Conference, 2002

2001
Dynamic Process Graphs and the Complexity of Scheduling
Electronic Colloquium on Computational Complexity (ECCC), 2001

Approximating Schedules for Dynamic Graphs Efficiently
Electronic Colloquium on Computational Complexity (ECCC), 2001

Space Efficient Algorithms for Series-Parallel Graphs.
Proceedings of the STACS 2001, 2001

2000
Can large fanin circuits perform reliable computations in the presence of faults?
Theor. Comput. Sci., 2000

An Average-Case Optimal One-Variable Pattern Language Learner.
J. Comput. Syst. Sci., 2000

The Expressive Power and Complexity of Dynamic Process Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

The Complexity of Physical Mapping with Strict Chimerism.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

Average Case Complexity of Unbounded Fanin Circuits.
Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000

1999
Malign Distributions for Average Case Circuit Complexity.
Inf. Comput., 1999

On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games.
Computational Complexity, 1999

A Complete and Tight Average-Case Analysis of Learning Monomials.
Proceedings of the STACS 99, 1999

Scheduling Dynamic Graphs.
Proceedings of the STACS 99, 1999

1998
Can Large Fanin Circuits Perform Reliable Computations in the Presence of Noise?
Electronic Colloquium on Computational Complexity (ECCC), 1998

An Average-Case Optimal One-Variable Pattern Language Learner
Electronic Colloquium on Computational Complexity (ECCC), 1998

The complexity of broadcasting in planar and decomposable graphs.
Discrete Applied Mathematics, 1998

Learning One-Variable Pattern Languages in Linear Average Time.
Proceedings of the Eleventh Annual Conference on Computational Learning Theory, 1998

1997
Report Dagstuhl Seminar on Time Services, Schloß Dagstuhl, March 11-15, 1996.
Real-Time Systems, 1997

An Average Complexity Measure that Yields Tight Hierarchies.
Computational Complexity, 1997

Computational Limitations of Stochastic Turing Machines and Arthur-Merlin Games with Small Space Bounds.
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

Can Large Fanin Circuits Perform Reliable Computations in the Presence of Noise ?
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996
The Sublogarithmic Alternating Space World.
SIAM J. Comput., 1996

Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines.
SIAM J. Comput., 1996

1995
The Sublogarithmic Alternating Space World
Electronic Colloquium on Computational Complexity (ECCC), 1995

Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write PRAMs
Electronic Colloquium on Computational Complexity (ECCC), 1995

Data Transmission in Processor Networks.
Proceedings of the Distributed Algorithms, 9th International Workshop, 1995

Malign Distributions for Average Case Circuit Complexity.
STACS, 1995

1994
Exact Lower Time Bounds for Computing Boolean Functions on CREW PRAMs.
J. Comput. Syst. Sci., 1994

The Complexity of Broadcasting in Planar and Decomposable Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

Circuit complexity: from the worst case to the average case.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Observable Clock Synchronization (Extended Abstract).
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

The Average Case Complexity of the Parallel Prefix Problem.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

The Complexity World below Logarithmic Space.
Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28, 1994

1993
Different Modes of Communication.
SIAM J. Comput., 1993

Precise Average Case Complexity.
Proceedings of the STACS 93, 1993

Separating the Lower Levels of the Sublogarithmic Space Hierarchy.
Proceedings of the STACS 93, 1993

1992
The Complexity of Scheduling Problems with Communication Delays for Trees.
Proceedings of the Algorithm Theory, 1992

Area Efficient Methods to Increase the Reliability of Circuits.
Proceedings of the Data Structures and Efficient Algorithms, 1992

1991
Reliable Computation with Noisy Circuits and Decision Trees-A General n log n Lower Bound
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Graph Theoretical Methods for the Design of Parallel Algorithms.
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1990
Early Stopping in Byzantine Agreement
J. ACM, October, 1990

Renaming in an Asynchronous Environment
J. ACM, July, 1990

Relations between Communication Complexity Classes.
J. Comput. Syst. Sci., 1990

Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous Writes.
SPAA, 1990

Einführung in die Komplexitätstheorie
Teubner, ISBN: 3-519-02275-3, 1990

1989
Parallele Maschinenmodelle und Komplexitätsklassen.
it - Informationstechnik, 1989

Area Efficient Methods to Increase the Reliability of Combinatorial Circuits.
Proceedings of the STACS 89, 1989

1988
On Different Modes of Communication (Extended Abstract)
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Relations between communication complexity classes.
Proceedings of the Proceedings: Third Annual Structure in Complexity Theory Conference, 1988

1987
Simultaneous WRITES of parallel random access machines do not help to compute simple arithmetic functions.
J. ACM, 1987

Lower Bounds for Synchronous Networks and the Advantage of Local Information.
Proceedings of the Distributed Algorithms, 1987

Konsistenz und Fehlertoleranz in Verteilten Systemen - Das Problem der Byzantinischen Generäle.
GI Jahrestagung, 1987

Achievable Cases in an Asynchronous Environment (Extended Abstract)
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986
Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes.
SIAM J. Comput., 1986

Parallel Machines and their Communication Theoretical Limits.
Proceedings of the STACS 86, 1986

1985
Bounds on Information Exchange for Byzantine Agreement
J. ACM, January, 1985

Probabilistic Parallel Algorithms for Sorting and Selection.
SIAM J. Comput., 1985

A New Solution for the Byzantine Generals Problem
Information and Control, 1985

1984
Two Nonlinear Lower Bounds for On-Line Computations
Information and Control, 1984

On the Limits to Speed Up Parallel Machines by Large Hardware and Unbounded Communication
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1983
Two Nonlinear Lower Bounds
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

A New Solution for the Byzantine Generals Problem (Extended Abstract).
Proceedings of the Fundamentals of Computation Theory, 1983

1982
A Fast Implementation of a Multidimensional Storage Into a Tree Storage.
Theor. Comput. Sci., 1982

Bounds on Information Exchange for Byzantine Agreement.
Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1982

'Eventual' Is Earlier than 'Immediate'
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

1981
On Time versus Space II. (Turing Machines).
J. Comput. Syst. Sci., 1981

A Fast Probabilistic Parallel Sorting Algorithm
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1980
Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game.
J. ACM, 1980

On Alternation II. A Graph Theoretic Approach to Determinism Versus Nondeterminism.
Acta Inf., 1980

On Alternation.
Acta Inf., 1980

A "Fast Implementation" of a Multidimensional Storage into a Tree Storage.
Proceedings of the Automata, 1980

1979
Beziehungen zwischen Rechenzeit, Speicherplatz und Speicherstruktur.
PhD thesis, 1979

A Graph Theoretic Approach to Determinism versus Non-Determinism.
Proceedings of the Theoretical Computer Science, 1979

On Time versus Space II
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978
Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game (Preliminary Version)
Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978

On Alternation (Preliminary Version)
Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978


  Loading...