Non-Uniform Complexity Classes and Random Languages. - Martin Mundhenk; Rainer Schuler (SCT, 1990)

Random languages for nonuniform complexity classes. - Martin Mundhenk; Rainer Schuler (J. Complex., 1991)

Zufall als Ressource für Komplexitätsklassen. - Rainer Schuler (1991)

Towards Average-Case Complexity Analysis of NP Optimization Problems. - Rainer Schuler; Osamu Watanabe 001 (SCT, 1995)

Sets Computable in Polynomial Time on Average. - Rainer Schuler; Tomoyuki Yamakami (COCOON, 1995)

Average Polynominal Time Is Hard for Exponential Time Under sn-Reductions. - Rainer Schuler (FSTTCS, 1995)

Structure in Average Case Complexity. - Christoph Karg; Rainer Schuler (ISAAC, 1995)

On Helping and Interactive Proof Systems. - Vikraman Arvind; Johannes Köbler; Rainer Schuler (Int. J. Found. Comput. Sci., 1995)

Some Properties of Sets Tractable Under Every Polynomial-Time Computable Distribution. - Rainer Schuler (Inf. Process. Lett., 1995)

If NP has Polynomial-Size Circuits, then MA=AM. - Vikraman Arvind; Johannes Köbler; Uwe Schöning; Rainer Schuler (Theor. Comput. Sci., 1995)

Truth-table Closure and Turing Closure of Average Polynomial Time have Different Measures in EXP. - Rainer Schuler (CCC, 1996)

Structural Average Case Complexity. - Rainer Schuler; Tomoyuki Yamakami (J. Comput. Syst. Sci., 1996)

A Note on Universal Distributions for Polynomial-Time Computable Distributions. - Rainer Schuler (CCC, 1997)

Average-Case Intractability vs. Worst-Case Intractability - Johannes Köbler; Rainer Schuler (Electron. Colloquium Comput. Complex., 1998)

Universal Distributions and Time-Bounded Kolmogorov Complexity. - Rainer Schuler (STACS, 1999)

The Complexity of Generating Test Instances. - Christoph Karg; Johannes Köbler; Rainer Schuler (Chic. J. Theor. Comput. Sci., 1999)

On the difference between polynomial-time many-one and truth-table reducibilities on distributional problems - Shin Aida; Rainer Schuler; Tatsuie Tsukiji; Osamu Watanabe 001 (Electron. Colloquium Comput. Complex., 2000)

Resource-Bounded Measure and Learnability. - Wolfgang Lindner 002; Rainer Schuler; Osamu Watanabe 001 (Theory Comput. Syst., 2000)

DNA-based Parallel Computation of Simple Arithmetic. - Hubert Hug; Rainer Schuler (DNA, 2001)

Strategies for the development of a peptide computer. - Hubert Hug; Rainer Schuler (Bioinform., 2001)

Implementation of a Random Walk Method for Solving 3-SAT on Circular DNA Molecules. - Hubert Hug; Rainer Schuler (DNA, 2002)

A Probabilistic 3-SAT Algorithm Further Improved. - Thomas Hofmeister; Uwe Schöning; Rainer Schuler; Osamu Watanabe 001 (STACS, 2002)

The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems. - Vikraman Arvind; Rainer Schuler (ISAAC, 2003)

A Stochastic Approach to Count RNA Molecules Using DNA Sequencing Methods. - Boris Hollas; Rainer Schuler (WABI, 2003)

Improving a probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs - Sven Baumer; Rainer Schuler (Electron. Colloquium Comput. Complex., 2003)

Randomized Quicksort and the Entropy of the Random Number Generator - Beatrice List; Markus Maucher; Uwe Schöning; Rainer Schuler (Electron. Colloquium Comput. Complex., 2004)

Randomized Quicksort and the Entropy of the Random Source. - Beatrice List; Markus Maucher; Uwe Schöning; Rainer Schuler (COCOON, 2005)

An algorithm for the satisfiability problem of formulas in conjunctive normal form. - Rainer Schuler (J. Algorithms, 2005)

Randomized Algorithms for 3-SAT. - Thomas Hofmeister; Uwe Schöning; Rainer Schuler; Osamu Watanabe 001 (Theory Comput. Syst., 2007)

Perspective on mHealth Concepts to Ensure Users' Empowerment-From Adverse Event Tracking for COVID-19 Vaccinations to Oncological Treatment. - Julian D. Schwab; Johannes Schobel; Silke D. Werle; Axel Fürstberger; Nensi Ikonomi; Robin Szekely; Patrick Thiam; Rolf Hühne; Niels Jahn; Rainer Schuler; Peter Kuhn; Martin Holderried; et al. (IEEE Access, 2021)