Rainer Schuler

ORCID

Publication Activity (10 Years)

Years Active: 1990-2021
Publications (10 Years): 1

Top Venues

IEEE Access

University of Ulm, Germany (PHD)

Education History

University of Ulm, Germany

PHD

Publications

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, Florian Steger, Manfred Reichert, Udo X. Kaisers, Angelika M. R. Kestler, Thomas Seufferlein, Hans A. Kestler
Perspective on mHealth Concepts to Ensure Users' Empowerment-From Adverse Event Tracking for COVID-19 Vaccinations to Oncological Treatment. IEEE Access 9 (2021)
Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe
Randomized Algorithms for 3-SAT. Theory Comput. Syst. 40 (3) (2007)
Rainer Schuler
An algorithm for the satisfiability problem of formulas in conjunctive normal form. J. Algorithms 54 (1) (2005)
Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler
Randomized Quicksort and the Entropy of the Random Source. COCOON (2005)
Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler
Randomized QuickSort and the Entropy of the Random Source. Algebraic Methods in Computational Complexity (2004)
Johannes Köbler, Rainer Schuler
Average-case intractability vs. worst-case intractability. Inf. Comput. 190 (1) (2004)
Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler
Randomized Quicksort and the Entropy of the Random Number Generator Electron. Colloquium Comput. Complex. (059) (2004)
Vikraman Arvind, Rainer Schuler
The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems. ISAAC (2003)
Sven Baumer, Rainer Schuler
Improving a Probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs. SAT (2003)
Sven Baumer, Rainer Schuler
Improving a probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs Electron. Colloquium Comput. Complex. 10 (010) (2003)
Boris Hollas, Rainer Schuler
A Stochastic Approach to Count RNA Molecules Using DNA Sequencing Methods. WABI (2003)
Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe
The Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems. Theory Comput. Syst. 35 (4) (2002)
Hubert Hug, Rainer Schuler
Implementation of a Random Walk Method for Solving 3-SAT on Circular DNA Molecules. DNA (2002)
Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe
A Probabilistic 3-SAT Algorithm Further Improved. STACS (2002)
Hubert Hug, Rainer Schuler
Strategies for the development of a peptide computer. Bioinform. 17 (4) (2001)
Hubert Hug, Rainer Schuler
DNA-based Parallel Computation of Simple Arithmetic. DNA (2001)
Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe
On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems. STACS (2001)
Wolfgang Lindner, Rainer Schuler, Osamu Watanabe
Resource-Bounded Measure and Learnability. Theory Comput. Syst. 33 (2) (2000)
Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe
On the difference between polynomial-time many-one and truth-table reducibilities on distributional problems Electron. Colloquium Comput. Complex. 7 (81) (2000)
Rainer Schuler
Universal Distributions and Time-Bounded Kolmogorov Complexity. STACS (1999)
Christoph Karg, Johannes Köbler, Rainer Schuler
The Complexity of Generating Test Instances. Chic. J. Theor. Comput. Sci. 1999 (1999)
Johannes Köbler, Rainer Schuler
Average-Case Intractability vs. Worst-Case Intractability. MFCS (1998)
Wolfgang Lindner, Rainer Schuler, Osamu Watanabe
Resource Bounded Measure and Learnability. Computational Complexity Conference (1998)
Johannes Köbler, Rainer Schuler
Average-Case Intractability vs. Worst-Case Intractability Electron. Colloquium Comput. Complex. 5 (37) (1998)
Rainer Schuler
A Note on Universal Distributions for Polynomial-Time Computable Distributions. Computational Complexity Conference (1997)
Christoph Karg, Johannes Köbler, Rainer Schuler
The Complexity of Generating Test Instances. STACS (1997)
Rainer Schuler
Truth-table Closure and Turing Closure of Average Polynomial Time have Different Measures in EXP. Computational Complexity Conference (1996)
Rainer Schuler, Tomoyuki Yamakami
Structural Average Case Complexity. J. Comput. Syst. Sci. 52 (2) (1996)
Vikraman Arvind, Johannes Köbler, Uwe Schöning, Rainer Schuler
If NP has Polynomial-Size Circuits, then MA=AM. Theor. Comput. Sci. 137 (2) (1995)
Rainer Schuler, Osamu Watanabe
Towards Average-Case Complexity Analysis of NP Optimization Problems. Computational Complexity Conference (1995)
Christoph Karg, Rainer Schuler
Structure in Average Case Complexity. ISAAC (1995)
Rainer Schuler
Some Properties of Sets Tractable Under Every Polynomial-Time Computable Distribution. Inf. Process. Lett. 55 (4) (1995)
Vikraman Arvind, Johannes Köbler, Rainer Schuler
On Helping and Interactive Proof Systems. Int. J. Found. Comput. Sci. 6 (2) (1995)
Rainer Schuler, Tomoyuki Yamakami
Sets Computable in Polynomial Time on Average. COCOON (1995)
Rainer Schuler
Average Polynominal Time Is Hard for Exponential Time Under sn-Reductions. FSTTCS (1995)
Vikraman Arvind, Johannes Köbler, Rainer Schuler
On Helping and Interactive Proof Systems. ISAAC (1994)
Rainer Schuler, Tomoyuki Yamakami
Structural Average Case Complexity. FSTTCS (1992)
Martin Mundhenk, Rainer Schuler
Random languages for nonuniform complexity classes. J. Complex. 7 (3) (1991)
Martin Mundhenk, Rainer Schuler
Non-Uniform Complexity Classes and Random Languages. Computational Complexity Conference (1990)

Rainer Schuler.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Rainer Schuler