Rainer Schuler

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