Rüdiger Reischuk

ORCID

Publication Activity (10 Years)

Years Active: 1978-2022
Publications (10 Years): 17

Top Venues

Electron. Colloquium Comput. Complex.

Theor. Comput. Sci.

J. Comput. Syst. Sci.

IPEC

University of Bielefeld, Germany (PHD)

Education History

University of Bielefeld, Germany

PHD

Publications

Rüdiger Reischuk
The kangaroo problem. Theor. Comput. Sci. 898 (2022)
Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk
Learning residual alternating automata. Inf. Comput. 289 (Part) (2022)
Max Bannach, Zacharias Heinrich, Rüdiger Reischuk, Till Tantau
Dynamic Kernels for Hitting Sets and Set Packing. Algorithmica 84 (11) (2022)
Florian Thaeter, Rüdiger Reischuk
Improving Time Complexity and Utility of k-anonymous Microaggregation. ICETE (Selected Papers) (2021)
Florian Thaeter, Rüdiger Reischuk
Scalable k-anonymous Microaggregation: Exploiting the Tradeoff between Computational Complexity and Information Loss. SECRYPT (2021)
Max Bannach, Zacharias Heinrich, Rüdiger Reischuk, Till Tantau
Dynamic Kernels for Hitting Sets and Set Packing. IPEC (2021)
Florian Thaeter, Rüdiger Reischuk
Hardness of k-anonymous microaggregation. Discret. Appl. Math. 303 (2021)
Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk
-term DNF formulas from satisfying assignments. J. Comput. Syst. Sci. 106 (2019)
Max Bannach, Zacharias Heinrich, Rüdiger Reischuk, Till Tantau
Dynamic Kernels for Hitting Sets and Set Packing. Electron. Colloquium Comput. Complex. 26 (2019)
Florian Thaeter, Rüdiger Reischuk
Improving Anonymization Clustering. Sicherheit (2018)
Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk
Proper Learning of k-term DNF Formulas from Satisfying Assignments. Electron. Colloquium Comput. Complex. 24 (2017)
Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel
Security levels in steganography - Insecurity does not imply detectability. Theor. Comput. Sci. 692 (2017)
Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk
Learning Residual Alternating Automata. AAAI (2017)
Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk
Learning Residual Alternating Automata. Electron. Colloquium Comput. Complex. 24 (2017)
Sebastian Berndt, Rüdiger Reischuk
Steganography Based on Pattern Languages. LATA (2016)
Matthias Ernst, Maciej Liskiewicz, Rüdiger Reischuk
Algorithmic Learning for Steganography: Proper Learning of k-term DNF Formulas from Positive Samples. ISAAC (2015)
Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel
Security Levels in Steganography - Insecurity does not Imply Detectability. Electron. Colloquium Comput. Complex. 22 (2015)
Anna Gál, Michal Koucký, Oded Regev, Rüdiger Reischuk
Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121). Dagstuhl Reports 4 (3) (2014)
Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel
Grey-box steganography. Theor. Comput. Sci. 505 (2013)
Wolfgang W. Bein, Lawrence L. Larmore, John Noga, Rüdiger Reischuk
Knowledge State Algorithms. Algorithmica 60 (3) (2011)
Rüdiger Reischuk, Johannes Textor
Stochastic Search with Locally Clustered Targets: Learning from T Cells. ICARIS (2011)
Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel
Grey-Box Steganography. TAMC (2011)
Martin Grohe, Michal Koucký, Rüdiger Reischuk, Dieter van Melkebeek
Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121). Dagstuhl Reports 1 (3) (2011)
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. 20 (1) (2009)
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer
Improving the average delay of sorting. Theor. Comput. Sci. 410 (11) (2009)
Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, Dieter van Melkebeek
08381 Executive Summary - Computational Complexity of Discrete Problems. Computational Complexity of Discrete Problems (2008)
Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, Dieter van Melkebeek
08381 Abstracts Collection - Computational Complexity of Discrete Problems. Computational Complexity of Discrete Problems (2008)
Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk
Knowledge States: A Tool for Randomized Online Algorithms. HICSS (2008)
Maciej Liskiewicz, Rüdiger Reischuk
Preface. Theory Comput. Syst. 41 (2) (2007)
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer
Improving the Average Delay of Sorting. TAMC (2007)
Bodo Manthey, Rüdiger Reischuk
Smoothed analysis of binary search trees. Theor. Comput. Sci. 378 (3) (2007)
Jan Arpe, Rüdiger Reischuk
When Does Greedy Learning of Relevant Attributes Succeed? COCOON (2007)
Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk
Knowledge State Algorithms: Randomization with Limited Information CoRR (2007)
Jan Arpe, Rüdiger Reischuk
Learning juntas in the presence of noise. Theor. Comput. Sci. 384 (1) (2007)
Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek
06111 Abstracts Collection -- Complexity of Boolean Functions. Complexity of Boolean Functions (2006)
John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann
Learning a subclass of regular patterns in polynomial time. Theor. Comput. Sci. 364 (1) (2006)
Jan Arpe, Rüdiger Reischuk
On the Complexity of Optimal Grammar-Based Compression. DCC (2006)
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
Space efficient algorithms for directed series-parallel graphs. J. Algorithms 60 (2) (2006)
Nicolò Cesa-Bianchi, Rüdiger Reischuk, Thomas Zeugmann
Foreword. Theor. Comput. Sci. 350 (1) (2006)
Matthias Krause, Dieter van Melkebeek, Pavel Pudlák, Rüdiger Reischuk
06111 Executive Summary -- Complexity of Boolean Functions. Complexity of Boolean Functions (2006)
Jan Arpe, Rüdiger Reischuk
When Does Greedy Learning of Relevant Features Succeed? --- A Fourier-based Characterization ---. Electron. Colloquium Comput. Complex. 13 (065) (2006)
Jan Arpe, Rüdiger Reischuk
Learning Juntas in the Presence of Noise. TAMC (2006)
Bodo Manthey, Rüdiger Reischuk
Smoothed Analysis of Binary Search Trees. ISAAC (2005)
Bodo Manthey, Rüdiger Reischuk
The intractability of computing the Hamming distance. Theor. Comput. Sci. 337 (1-3) (2005)
Bodo Manthey, Rüdiger Reischuk
Smoothed Analysis of the Height of Binary Search Trees Electron. Colloquium Comput. Complex. (063) (2005)
Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk
Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems. ISPAN (2004)
John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann
A Polynomial Time Learner for a Subclass of Regular Patterns Electron. Colloquium Comput. Complex. (038) (2004)
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
Approximating schedules for dynamic process graphs efficiently. J. Discrete Algorithms 2 (4) (2004)
John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann
Learning a Subclass of Regular Patterns in Polynomial Time. ALT (2003)
Bodo Manthey, Rüdiger Reischuk
The Intractability of Computing the Hamming Distance. ISAAC (2003)
Jan Arpe, Rüdiger Reischuk
Robust Inference of Relevant Attributes. ALT (2003)
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
Private Computations in Networks: Topology versus Randomness. STACS (2003)
Nicolò Cesa-Bianchi, Masayuki Numao, Rüdiger Reischuk
Editors' Introduction. ALT (2002)
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
Space Efficient Algorithms for Directed Series-Parallel Graphs Electron. Colloquium Comput. Complex. (021) (2002)
Rüdiger Reischuk
Approximating Schedules for Dynamic Graphs Efficiently Electron. Colloquium Comput. Complex. 8 (38) (2001)
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
Dynamic Process Graphs and the Complexity of Scheduling Electron. Colloquium Comput. Complex. (090) (2001)
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
Space Efficient Algorithms for Series-Parallel Graphs. STACS (2001)
Rüdiger Reischuk, Thomas Zeugmann
An Average-Case Optimal One-Variable Pattern Language Learner. J. Comput. Syst. Sci. 60 (2) (2000)
Stephan Weis, Rüdiger Reischuk
The Complexity of Physical Mapping with Strict Chimerism. COCOON (2000)
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
The Expressive Power and Complexity of Dynamic Process Graphs. WG (2000)
Rüdiger Reischuk
Can large fanin circuits perform reliable computations in the presence of faults? Theor. Comput. Sci. 240 (2) (2000)
Andreas Jakoby, Rüdiger Reischuk
Average Case Complexity of Unbounded Fanin Circuits. Computational Complexity Conference (2000)
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
Scheduling Dynamic Graphs. STACS (1999)
Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
Malign Distributions for Average Case Circuit Complexity. Inf. Comput. 150 (2) (1999)
Maciej Liskiewicz, Rüdiger Reischuk
On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games. Comput. Complex. 8 (3) (1999)
Rüdiger Reischuk, Thomas Zeugmann
A Complete and Tight Average-Case Analysis of Learning Monomials. STACS (1999)
Rüdiger Reischuk, Thomas Zeugmann
An Average-Case Optimal One-Variable Pattern Language Learner Electron. Colloquium Comput. Complex. 5 (69) (1998)
Rüdiger Reischuk, Thomas Zeugmann
Learning One-Variable Pattern Languages in Linear Average Time. COLT (1998)
Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
The complexity of broadcasting in planar and decomposable graphs. Discret. Appl. Math. 83 (1-3) (1998)
Rüdiger Reischuk
Can Large Fanin Circuits Perform Reliable Computations in the Presence of Noise? Electron. Colloquium Comput. Complex. 5 (70) (1998)
Maciej Liskiewicz, Rüdiger Reischuk
Computational Limitations of Stochastic Turing Machines and Arthur-Merlin Games with Small Space Bounds. MFCS (1997)
Rüdiger Reischuk, Christian Schindelhauer
An Average Complexity Measure that Yields Tight Hierarchies. Comput. Complex. 6 (2) (1997)
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 Syst. 12 (3) (1997)
Rüdiger Reischuk
Can Large Fanin Circuits Perform Reliable Computations in the Presence of Noise ? COCOON (1997)
Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk
Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines. SIAM J. Comput. 25 (6) (1996)
Maciej Liskiewicz, Rüdiger Reischuk
The Sublogarithmic Alternating Space World. SIAM J. Comput. 25 (4) (1996)
Andreas Jakoby, Rüdiger Reischuk
Data Transmission in Processor Networks. WDAG (1995)
Maciej Liskiewicz, Rüdiger Reischuk
The Sublogarithmic Alternating Space World Electron. Colloquium Comput. Complex. 2 (5) (1995)
Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
Malign Distributions for Average Case Circuit Complexity. STACS (1995)
Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk
Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write PRAMs Electron. Colloquium Comput. Complex. 2 (4) (1995)
Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk
Exact Lower Time Bounds for Computing Boolean Functions on CREW PRAMs. J. Comput. Syst. Sci. 48 (2) (1994)
Maciej Liskiewicz, Rüdiger Reischuk
The Complexity World below Logarithmic Space. Computational Complexity Conference (1994)
Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
The Complexity of Broadcasting in Planar and Decomposable Graphs. WG (1994)
Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer, Stephan Weis
The Average Case Complexity of the Parallel Prefix Problem. ICALP (1994)
Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
Circuit complexity: from the worst case to the average case. STOC (1994)
Danny Dolev, Rüdiger Reischuk, H. Raymond Strong
Observable Clock Synchronization (Extended Abstract). PODC (1994)
Rüdiger Reischuk, Christian Schindelhauer
Precise Average Case Complexity. STACS (1993)
Maciej Liskiewicz, Rüdiger Reischuk
Separating the Lower Levels of the Sublogarithmic Space Hierarchy. STACS (1993)
Bernd Halstenberg, Rüdiger Reischuk
Different Modes of Communication. SIAM J. Comput. 22 (5) (1993)
Andreas Jakoby, Rüdiger Reischuk
The Complexity of Scheduling Problems with Communication Delays for Trees. SWAT (1992)
Rüdiger Reischuk, Bernd Schmeltz
Area Efficient Methods to Increase the Reliability of Circuits. Data Structures and Efficient Algorithms (1992)
Rüdiger Reischuk
Graph Theoretical Methods for the Design of Parallel Algorithms. FCT (1991)
Rüdiger Reischuk, Bernd Schmeltz
Reliable Computation with Noisy Circuits and Decision Trees-A General n log n Lower Bound FOCS (1991)
Hagit Attiya, Amotz Bar-Noy, Danny Dolev, David Peleg, Rüdiger Reischuk
Renaming in an Asynchronous Environment J. ACM 37 (3) (1990)
Danny Dolev, Rüdiger Reischuk, H. Raymond Strong
Early Stopping in Byzantine Agreement J. ACM 37 (4) (1990)
Bernd Halstenberg, Rüdiger Reischuk
Relations between Communication Complexity Classes. J. Comput. Syst. Sci. 41 (3) (1990)
Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk
Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous Writes. SPAA (1990)
Rüdiger Reischuk, Bernd Schmeltz
Area Efficient Methods to Increase the Reliability of Combinatorial Circuits. STACS (1989)
Rüdiger Reischuk
Parallele Maschinenmodelle und Komplexitätsklassen. it Inf. Technol. 31 (1) (1989)
Bernd Halstenberg, Rüdiger Reischuk
On Different Modes of Communication (Extended Abstract) STOC (1988)

Rüdiger Reischuk.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Rüdiger Reischuk