| 2021 | SECRYPT | Scalable k-anonymous Microaggregation: Exploiting the Tradeoff between Computational Complexity and Information Loss. | Florian Thaeter, Rdiger Reischuk |
| 2017 | AAAI | Learning Residual Alternating Automata. | Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rdiger Reischuk |
| 2016 | LATA | Steganography Based on Pattern Languages. | Sebastian Berndt, Rdiger Reischuk |
| 2015 | ISAAC | Algorithmic Learning for Steganography: Proper Learning of k-term DNF Formulas from Positive Samples. | Matthias Ernst, Maciej Liskiewicz, Rdiger Reischuk |
| 2011 | TAMC | Grey-Box Steganography. | Maciej Liskiewicz, Rdiger Reischuk, Ulrich Wlfel |
| 2007 | COCOON | When Does Greedy Learning of Relevant Attributes Succeed? | Jan Arpe, Rdiger Reischuk |
| 2007 | TAMC | Improving the Average Delay of Sorting. | Andreas Jakoby, Maciej Liskiewicz, Rdiger Reischuk, Christian Schindelhauer |
| 2006 | DCC | On the Complexity of Optimal Grammar-Based Compression. | Jan Arpe, Rdiger Reischuk |
| 2006 | TAMC | Learning Juntas in the Presence of Noise. | Jan Arpe, Rdiger Reischuk |
| 2005 | ISAAC | Smoothed Analysis of Binary Search Trees. | Bodo Manthey, Rdiger Reischuk |
| 2003 | ALT | Robust Inference of Relevant Attributes. | Jan Arpe, Rdiger Reischuk |
| 2003 | ALT | Learning a Subclass of Regular Patterns in Polynomial Time. | John Case, Sanjay Jain, Rdiger Reischuk, Frank Stephan, Thomas Zeugmann |
| 2003 | ISAAC | The Intractability of Computing the Hamming Distance. | Bodo Manthey, Rdiger Reischuk |
| 2003 | STACS | Private Computations in Networks: Topology versus Randomness. | Andreas Jakoby, Maciej Liskiewicz, Rdiger Reischuk |
| 2002 | ALT | Editors' Introduction. | Nicol Cesa-Bianchi, Masayuki Numao, Rdiger Reischuk |
| 2001 | STACS | Space Efficient Algorithms for Series-Parallel Graphs. | Andreas Jakoby, Maciej Liskiewicz, Rdiger Reischuk |
| 2000 | COCOON | The Complexity of Physical Mapping with Strict Chimerism. | Stephan Weis, Rdiger Reischuk |
| 2000 | WG | The Expressive Power and Complexity of Dynamic Process Graphs. | Andreas Jakoby, Maciej Liskiewicz, Rdiger Reischuk |
| 1999 | STACS | Scheduling Dynamic Graphs. | Andreas Jakoby, Maciej Liskiewicz, Rdiger Reischuk |
| 1999 | STACS | A Complete and Tight Average-Case Analysis of Learning Monomials. | Rdiger Reischuk, Thomas Zeugmann |
| 1998 | COLT | Learning One-Variable Pattern Languages in Linear Average Time. | Rdiger Reischuk, Thomas Zeugmann |
| 1997 | COCOON | Can Large Fanin Circuits Perform Reliable Computations in the Presence of Noise ? | Rdiger Reischuk |
| 1997 | MFCS | Computational Limitations of Stochastic Turing Machines and Arthur-Merlin Games with Small Space Bounds. | Maciej Liskiewicz, Rdiger Reischuk |
| 1995 | STACS | Malign Distributions for Average Case Circuit Complexity. | Andreas Jakoby, Rdiger Reischuk, Christian Schindelhauer |
| 1994 | ICALP | The Average Case Complexity of the Parallel Prefix Problem. | Andreas Jakoby, Rdiger Reischuk, Christian Schindelhauer, Stephan Weis |
| 1994 | PODC | Observable Clock Synchronization (Extended Abstract). | Danny Dolev, Rdiger Reischuk, H. Raymond Strong |
| 1994 | STOC | Circuit complexity: from the worst case to the average case. | Andreas Jakoby, Rdiger Reischuk, Christian Schindelhauer |
| 1994 | WG | The Complexity of Broadcasting in Planar and Decomposable Graphs. | Andreas Jakoby, Rdiger Reischuk, Christian Schindelhauer |
| 1993 | STACS | Separating the Lower Levels of the Sublogarithmic Space Hierarchy. | Maciej Liskiewicz, Rdiger Reischuk |
| 1993 | STACS | Precise Average Case Complexity. | Rdiger Reischuk, Christian Schindelhauer |
| 1991 | FCT | Graph Theoretical Methods for the Design of Parallel Algorithms. | Rdiger Reischuk |
| 1991 | FOCS | Reliable Computation with Noisy Circuits and Decision Trees-A General n log n Lower Bound | Rdiger Reischuk, Bernd Schmeltz |
| 1990 | SPAA | Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous Writes. | Martin Dietzfelbinger, Miroslaw Kutylowski, Rdiger Reischuk |
| 1989 | STACS | Area Efficient Methods to Increase the Reliability of Combinatorial Circuits. | Rdiger Reischuk, Bernd Schmeltz |
| 1988 | STOC | On Different Modes of Communication (Extended Abstract) | Bernd Halstenberg, Rdiger Reischuk |
| 1987 | FOCS | Achievable Cases in an Asynchronous Environment (Extended Abstract) | Hagit Attiya, Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg, Rdiger Reischuk |
| 1987 | GI | Konsistenz und Fehlertoleranz in Verteilten Systemen - Das Problem der Byzantinischen Generle. | Rdiger Reischuk |
| 1986 | STACS | Parallel Machines and their Communication Theoretical Limits. | Rdiger Reischuk |
| 1984 | FOCS | On the Limits to Speed Up Parallel Machines by Large Hardware and Unbounded Communication | Friedhelm Meyer auf der Heide, Rdiger Reischuk |
| 1983 | FCT | A New Solution for the Byzantine Generals Problem (Extended Abstract). | Rdiger Reischuk |
| 1983 | STOC | Two Nonlinear Lower Bounds | Pavol Duris, Zvi Galil, Wolfgang J. Paul, Rdiger Reischuk |
| 1982 | FOCS | 'Eventual' Is Earlier than 'Immediate' | Danny Dolev, Rdiger Reischuk, H. Raymond Strong |
| 1982 | PODC | Bounds on Information Exchange for Byzantine Agreement. | Danny Dolev, Rdiger Reischuk |
| 1981 | FOCS | A Fast Probabilistic Parallel Sorting Algorithm | Rdiger Reischuk |
| 1980 | ICALP | A "Fast Implementation" of a Multidimensional Storage into a Tree Storage. | Rdiger Reischuk |
| 1979 | FOCS | On Time versus Space II | Wolfgang J. Paul, Rdiger Reischuk |
| 1978 | FOCS | On Alternation (Preliminary Version) | Wolfgang J. Paul, Ernst-Jrgen Prau, Rdiger Reischuk |
| 1978 | FOCS | Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game (Preliminary Version) | Rdiger Reischuk |