- CSB - MetaPress - Google - Bing - Yahoo
 | 2007 | |
|---|---|---|
| j12 |      | Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe: Randomized Algorithms for 3-SAT. Theory Comput. Syst. 40(3): 249-262 (2007) |
| 2005 | ||
| j11 | | Rainer Schuler: An algorithm for the satisfiability problem of formulas in conjunctive normal form. J. Algorithms 54(1): 40-44 (2005) |
| c22 | | Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler: Randomized Quicksort and the Entropy of the Random Source. COCOON 2005: 450-460 |
| 2004 | ||
| j10 | | Johannes Köbler, Rainer Schuler: Average-case intractability vs. worst-case intractability. Inf. Comput. 190(1): 1-17 (2004) |
| c21 | | Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler: Randomized QuickSort and the Entropy of the Random Source. Algebraic Methods in Computational Complexity 2004 |
| i4 | | Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler: Randomized Quicksort and the Entropy of the Random Number Generator. Electronic Colloquium on Computational Complexity (ECCC)(059) (2004) |
| 2003 | ||
| c20 | | Vikraman Arvind, Rainer Schuler: The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems. ISAAC 2003: 168-177 |
| c19 | | Sven Baumer, Rainer Schuler: Improving a Probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs. SAT 2003: 150-161 |
| c18 | | Boris Hollas, Rainer Schuler: A Stochastic Approach to Count RNA Molecules Using DNA Sequencing Methods. WABI 2003: 55-62 |
| i3 | | Sven Baumer, Rainer Schuler: Improving a probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs. Electronic Colloquium on Computational Complexity (ECCC) 10(010) (2003) |
| 2002 | ||
| j9 | | 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): 449-463 (2002) |
| c17 | | Hubert Hug, Rainer Schuler: Implementation of a Random Walk Method for Solving 3-SAT on Circular DNA Molecules. DNA 2002: 133-142 |
| c16 | | Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe: A Probabilistic 3-SAT Algorithm Further Improved. STACS 2002: 192-202 |
| 2001 | ||
| j8 | | Hubert Hug, Rainer Schuler: Strategies for the development of a peptide computer. Bioinformatics 17(4): 364-368 (2001) |
| c15 | | |
| c14 | | 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: 51-62 |
| 2000 | ||
| j7 | | Wolfgang Lindner, Rainer Schuler, Osamu Watanabe: Resource-Bounded Measure and Learnability. Theory Comput. Syst. 33(2): 151-170 (2000) |
| i2 | | Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe: On the difference between polynomial-time many-one and truth-table reducibilities on distributional problems. Electronic Colloquium on Computational Complexity (ECCC) 7(81) (2000) |
| 1999 | ||
| j6 | | Christoph Karg, Johannes Köbler, Rainer Schuler: The Complexity of Generating Test Instances. Chicago J. Theor. Comput. Sci. 1999 (1999) |
| c13 | | |
| 1998 | ||
| c12 | | Wolfgang Lindner, Rainer Schuler, Osamu Watanabe: Resource Bounded Measure and Learnability. IEEE Conference on Computational Complexity 1998: 261- |
| c11 | | Johannes Köbler, Rainer Schuler: Average-Case Intractability vs. Worst-Case Intractability. MFCS 1998: 493-502 |
| i1 | | Johannes Köbler, Rainer Schuler: Average-Case Intractability vs. Worst-Case Intractability. Electronic Colloquium on Computational Complexity (ECCC) 5(37) (1998) |
| 1997 | ||
| c10 | | Rainer Schuler: A Note on Universal Distributions for Polynomial-Time Computable Distributions. IEEE Conference on Computational Complexity 1997: 69-73 |
| c9 | | Christoph Karg, Johannes Köbler, Rainer Schuler: The Complexity of Generating Test Instances. STACS 1997: 375-386 |
| 1996 | ||
| j5 | | Rainer Schuler, Tomoyuki Yamakami: Structural Average Case Complexity. J. Comput. Syst. Sci. 52(2): 308-348 (1996) |
| c8 | | Rainer Schuler: Truth-table Closure and Turing Closure of Average Polynomial Time have Different Measures in EXP. IEEE Conference on Computational Complexity 1996: 190-195 |
| 1995 | ||
| j4 | | Vikraman Arvind, Johannes Köbler, Rainer Schuler: On Helping and Interactive Proof Systems. Int. J. Found. Comput. Sci. 6(2): 137-153 (1995) |
| j3 | | Rainer Schuler: Some Properties of Sets Tractable Under Every Polynomial-Time Computable Distribution. Inf. Process. Lett. 55(4): 179-184 (1995) |
| j2 | | Vikraman Arvind, Johannes Köbler, Uwe Schöning, Rainer Schuler: If NP has Polynomial-Size Circuits, then MA=AM. Theor. Comput. Sci. 137(2): 279-282 (1995) |
| c7 | | Rainer Schuler, Osamu Watanabe: Towards Average-Case Complexity Analysis of NP Optimization Problems. Structure in Complexity Theory Conference 1995: 148-159 |
| c6 | | Rainer Schuler, Tomoyuki Yamakami: Sets Computable in Polynomial Time on Average. COCOON 1995: 400-409 |
| c5 | | Rainer Schuler: Average Polynominal Time Is Hard for Exponential Time Under sn-Reductions. FSTTCS 1995: 240-247 |
| c4 | | |
| 1994 | ||
| c3 | | Vikraman Arvind, Johannes Köbler, Rainer Schuler: On Helping and Interactive Proof Systems. ISAAC 1994: 137-145 |
| 1992 | ||
| c2 | | |
| 1991 | ||
| j1 | | Martin Mundhenk, Rainer Schuler: Random languages for nonuniform complexity classes. J. Complexity 7(3): 296-310 (1991) |
| 1990 | ||
| c1 | | Martin Mundhenk, Rainer Schuler: Non-Uniform Complexity Classes and Random Languages. Structure in Complexity Theory Conference 1990: 110-119 |
Data released under the ODC-BY 1.0 license — See also our legal information page