The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Rainer Schuler: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Wolfgang Lindner, Rainer Schuler, Osamu Watanabe
    Resource Bounded Measure and Learnability. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:261-0 [Conf]
  2. Martin Mundhenk, Rainer Schuler
    Non-Uniform Complexity Classes and Random Languages. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:110-119 [Conf]
  3. Rainer Schuler
    Truth-table Closure and Turing Closure of Average Polynomial Time have Different Measures in EXP. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:190-195 [Conf]
  4. Rainer Schuler
    A Note on Universal Distributions for Polynomial-Time Computable Distributions. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:69-73 [Conf]
  5. Rainer Schuler, Osamu Watanabe
    Towards Average-Case Complexity Analysis of NP Optimization Problems. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:148-159 [Conf]
  6. Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler
    Randomized Quicksort and the Entropy of the Random Source. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:450-460 [Conf]
  7. Rainer Schuler, Tomoyuki Yamakami
    Sets Computable in Polynomial Time on Average. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:400-409 [Conf]
  8. Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler
    Randomized QuickSort and the Entropy of the Random Source. [Citation Graph (0, 0)][DBLP]
    Algebraic Methods in Computational Complexity, 2004, pp:- [Conf]
  9. Hubert Hug, Rainer Schuler
    DNA-based Parallel Computation of Simple Arithmetic. [Citation Graph (0, 0)][DBLP]
    DNA, 2001, pp:321-328 [Conf]
  10. Hubert Hug, Rainer Schuler
    Implementation of a Random Walk Method for Solving 3-SAT on Circular DNA Molecules. [Citation Graph (0, 0)][DBLP]
    DNA, 2002, pp:133-142 [Conf]
  11. Rainer Schuler
    Average Polynominal Time Is Hard for Exponential Time Under sn-Reductions. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:240-247 [Conf]
  12. Rainer Schuler, Tomoyuki Yamakami
    Structural Average Case Complexity. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:128-139 [Conf]
  13. Vikraman Arvind, Johannes Köbler, Rainer Schuler
    On Helping and Interactive Proof Systems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:137-145 [Conf]
  14. Vikraman Arvind, Rainer Schuler
    The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:168-177 [Conf]
  15. Christoph Karg, Rainer Schuler
    Structure in Average Case Complexity. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:62-71 [Conf]
  16. Johannes Köbler, Rainer Schuler
    Average-Case Intractability vs. Worst-Case Intractability. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:493-502 [Conf]
  17. Sven Baumer, Rainer Schuler
    Improving a Probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs. [Citation Graph (0, 0)][DBLP]
    SAT, 2003, pp:150-161 [Conf]
  18. Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe
    On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:51-62 [Conf]
  19. Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe
    A Probabilistic 3-SAT Algorithm Further Improved. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:192-202 [Conf]
  20. Christoph Karg, Johannes Köbler, Rainer Schuler
    The Complexity of Generating Test Instances. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:375-386 [Conf]
  21. Rainer Schuler
    Universal Distributions and Time-Bounded Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:434-443 [Conf]
  22. Boris Hollas, Rainer Schuler
    A Stochastic Approach to Count RNA Molecules Using DNA Sequencing Methods. [Citation Graph (0, 0)][DBLP]
    WABI, 2003, pp:55-62 [Conf]
  23. Hubert Hug, Rainer Schuler
    Strategies for the development of a peptide computer. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2001, v:17, n:4, pp:364-368 [Journal]
  24. Christoph Karg, Johannes Köbler, Rainer Schuler
    The Complexity of Generating Test Instances. [Citation Graph (0, 0)][DBLP]
    Chicago J. Theor. Comput. Sci., 1999, v:1999, n:, pp:- [Journal]
  25. Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe
    On the difference between polynomial-time many-one and truth-table reducibilities on distributional problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:81, pp:- [Journal]
  26. Sven Baumer, Rainer Schuler
    Improving a probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:010, pp:- [Journal]
  27. Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler
    Randomized Quicksort and the Entropy of the Random Number Generator [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:059, pp:- [Journal]
  28. Johannes Köbler, Rainer Schuler
    Average-case intractability vs. worst-case intractability. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:190, n:1, pp:1-17 [Journal]
  29. Vikraman Arvind, Johannes Köbler, Rainer Schuler
    On Helping and Interactive Proof Systems. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1995, v:6, n:2, pp:137-153 [Journal]
  30. Rainer Schuler
    Some Properties of Sets Tractable Under Every Polynomial-Time Computable Distribution. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:55, n:4, pp:179-184 [Journal]
  31. Rainer Schuler
    An algorithm for the satisfiability problem of formulas in conjunctive normal form. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:54, n:1, pp:40-44 [Journal]
  32. Martin Mundhenk, Rainer Schuler
    Random languages for nonuniform complexity classes. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1991, v:7, n:3, pp:296-310 [Journal]
  33. Rainer Schuler, Tomoyuki Yamakami
    Structural Average Case Complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:52, n:2, pp:308-348 [Journal]
  34. Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe
    The Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2002, v:35, n:4, pp:449-463 [Journal]
  35. Wolfgang Lindner, Rainer Schuler, Osamu Watanabe
    Resource-Bounded Measure and Learnability. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2000, v:33, n:2, pp:151-170 [Journal]
  36. Vikraman Arvind, Johannes Köbler, Uwe Schöning, Rainer Schuler
    If NP has Polynomial-Size Circuits, then MA=AM. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:137, n:2, pp:279-282 [Journal]
  37. Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe
    Randomized Algorithms for 3-SAT. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:40, n:3, pp:249-262 [Journal]

Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002