| 2005 | COCOON | Randomized Quicksort and the Entropy of the Random Source. | Beatrice List, Markus Maucher, Uwe Schning, Rainer Schuler |
| 2003 | ISAAC | The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems. | Vikraman Arvind, Rainer Schuler |
| 2003 | SAT | Improving a Probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs. | Sven Baumer, Rainer Schuler |
| 2003 | WABI | A Stochastic Approach to Count RNA Molecules Using DNA Sequencing Methods. | Boris Hollas, Rainer Schuler |
| 2002 | DNA | Implementation of a Random Walk Method for Solving 3-SAT on Circular DNA Molecules. | Hubert Hug, Rainer Schuler |
| 2002 | STACS | A Probabilistic 3-SAT Algorithm Further Improved. | Thomas Hofmeister, Uwe Schning, Rainer Schuler, Osamu Watanabe |
| 2001 | DNA | DNA-based Parallel Computation of Simple Arithmetic. | Hubert Hug, Rainer Schuler |
| 2001 | STACS | On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems. | Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe |
| 1999 | STACS | Universal Distributions and Time-Bounded Kolmogorov Complexity. | Rainer Schuler |
| 1998 | MFCS | Average-Case Intractability vs. Worst-Case Intractability. | Johannes Kbler, Rainer Schuler |
| 1997 | STACS | The Complexity of Generating Test Instances. | Christoph Karg, Johannes Kbler, Rainer Schuler |
| 1995 | COCOON | Sets Computable in Polynomial Time on Average. | Rainer Schuler, Tomoyuki Yamakami |
| 1995 | ISAAC | Structure in Average Case Complexity. | Christoph Karg, Rainer Schuler |
| 1994 | ISAAC | On Helping and Interactive Proof Systems. | Vikraman Arvind, Johannes Kbler, Rainer Schuler |