Rainer Schuler

According to our database, Rainer Schuler authored at least 30 papers between 1990 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

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, Florian Steger, Manfred Reichert, Udo X. Kaisers, Angelika M. R. Kestler, Thomas Seufferlein, Hans A. Kestler

IEEE Access, 2021

2007

Randomized Algorithms for 3-SAT.

Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe

Theory Comput. Syst., 2007

2005

An algorithm for the satisfiability problem of formulas in conjunctive normal form.

Rainer Schuler

J. Algorithms, 2005

Randomized Quicksort and the Entropy of the Random Source.

Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Randomized Quicksort and the Entropy of the Random Number Generator

Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler

Electron. Colloquium Comput. Complex., 2004

2003

A Stochastic Approach to Count RNA Molecules Using DNA Sequencing Methods.

Boris Hollas, Rainer Schuler

Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

Improving a Probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs.

Sven Baumer, Rainer Schuler

Proceedings of the Theory and Applications of Satisfiability Testing, 2003

The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems.

Vikraman Arvind, Rainer Schuler

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002

A Probabilistic 3-SAT Algorithm Further Improved.

Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe

Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

Implementation of a Random Walk Method for Solving 3-SAT on Circular DNA Molecules.

Hubert Hug, Rainer Schuler

Proceedings of the DNA Computing, 8th International Workshop on DNA Based Computers, 2002

2001

Strategies for the development of a peptide computer.

Hubert Hug, Rainer Schuler

Bioinform., 2001

On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems.

Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe

Proceedings of the STACS 2001, 2001

DNA-based Parallel Computation of Simple Arithmetic.

Hubert Hug, Rainer Schuler

Proceedings of the DNA Computing, 7th International Workshop on DNA-Based Computers, 2001

1999

Universal Distributions and Time-Bounded Kolmogorov Complexity.

Rainer Schuler

Proceedings of the STACS 99, 1999

1998

Average-Case Intractability vs. Worst-Case Intractability.

Johannes Köbler, Rainer Schuler

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Resource Bounded Measure and Learnability.

Wolfgang Lindner, Rainer Schuler, Osamu Watanabe

Proceedings of the 13th Annual IEEE Conference on Computational Complexity, 1998

1997

The Complexity of Generating Test Instances.

Christoph Karg, Johannes Köbler, Rainer Schuler

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

A Note on Universal Distributions for Polynomial-Time Computable Distributions.

Rainer Schuler

Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997

1996

Truth-table Closure and Turing Closure of Average Polynomial Time have Different Measures in EXP.

Rainer Schuler

Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

1995

If NP has Polynomial-Size Circuits, then MA=AM.

Vikraman Arvind, Johannes Köbler, Uwe Schöning, Rainer Schuler

Theor. Comput. Sci., 1995

Some Properties of Sets Tractable Under Every Polynomial-Time Computable Distribution.

Rainer Schuler

Inf. Process. Lett., 1995

Structure in Average Case Complexity.

Christoph Karg, Rainer Schuler

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Average Polynominal Time Is Hard for Exponential Time Under sn-Reductions.

Rainer Schuler

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

Sets Computable in Polynomial Time on Average.

Rainer Schuler, Tomoyuki Yamakami

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

Towards Average-Case Complexity Analysis of NP Optimization Problems.

Rainer Schuler, Osamu Watanabe

Proceedings of the Tenth Annual Structure in Complexity Theory Conference, 1995

1994

On Helping and Interactive Proof Systems.

Vikraman Arvind, Johannes Köbler, Rainer Schuler

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1992

Structural Average Case Complexity.

Rainer Schuler, Tomoyuki Yamakami

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1992

1991

Zufall als Ressource für Komplexitätsklassen.

Rainer Schuler

PhD thesis, 1991

Random languages for nonuniform complexity classes.

Martin Mundhenk, Rainer Schuler

J. Complex., 1991

1990

Non-Uniform Complexity Classes and Random Languages.

Martin Mundhenk, Rainer Schuler

Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990