| Measurement of the number of molecules of a single mRNA species in a complex mRNA preparation H Hug, R Schuler Journal of theoretical biology 221 (4), 615-624, 2003 | 173 | 2003 |
| A Probabilistic 3—SAT Algorithm Further Improved T Hofmeister, U Schöning, R Schuler, O Watanabe STACS 2002: 19th Annual Symposium on Theoretical Aspects of Computer Science …, 2002 | 118 | 2002 |
| An algorithm for the satisfiability problem of formulas in conjunctive normal form R Schuler Journal of Algorithms 54 (1), 40-44, 2005 | 110 | 2005 |
| A stochastic approach to count RNA molecules using DNA sequencing methods B Hollas, R Schuler International Workshop on Algorithms in Bioinformatics, 55-62, 2003 | 72 | 2003 |
| DNA-based parallel computation of simple arithmetic H Hug, R Schuler International Workshop on DNA-Based Computers, 321-328, 2001 | 69 | 2001 |
| Improving a probabilistic 3-SAT algorithm by dynamic search and independent clause pairs S Baumer, R Schuler Theory and Applications of Satisfiability Testing: 6th International …, 2004 | 50 | 2004 |
| Strategies for the development of a peptide computer H Hug, R Schuler Bioinformatics 17 (4), 364-368, 2001 | 37 | 2001 |
| If NP has polynomial-size circuits, then MA= AM V Arvind, J Köbler, U Schöning, R Schuler Theoretical Computer Science 137 (2), 279-282, 1995 | 32 | 1995 |
| The quantum query complexity of 0-1 knapsack and associated claw problems V Arvind, R Schuler Algorithms and Computation: 14th International Symposium, ISAAC 2003, Kyoto …, 2003 | 26 | 2003 |
| Towards average-case complexity analysis of NP optimization problems R Schuler, O Watanabe Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference …, 1995 | 23 | 1995 |
| Sets computable in polynomial time on average R Schuler, T Yamakami International Computing and Combinatorics Conference, 400-409, 1995 | 22 | 1995 |
| Some properties of sets tractable under every polynomial-time computable distribution R Schuler Information Processing Letters 55 (4), 179-184, 1995 | 21 | 1995 |
| Structural average case complexity: Preliminary report R Schuler, T Yamakami International Conference on Foundations of Software Technology and …, 1992 | 18 | 1992 |
| Resource-bounded measure and learnability W Lindner, R Schuler, O Watanabe Theory of Computing Systems 33, 151-170, 2000 | 16 | 2000 |
| Average-case intractability vs. worst-case intractability J Köbler, R Schuler Mathematical Foundations of Computer Science 1998: 23rd International …, 1998 | 16* | 1998 |
| Randomized algorithms for 3-SAT T Hofmeister, U Schoning, R Schuler, O Watanabe Theory of Computing Systems 40, 249-262, 2007 | 15 | 2007 |
| On helping and interactive proof systems V Arvind, J Köbler, R Schuler International Journal of Foundations of Computer Science 6 (02), 137-153, 1995 | 15 | 1995 |
| An improved randomized algorithm for 3-SAT R Schuler, U Schöning, O Watanabe, M Ookayama Tokyo Institute of Technology. Department of Information Sciences, 2001 | 14 | 2001 |
| Truth-table closure and Turing closure of average polynomial time have different measures in EXP R Schuler Proceedings of Computational Complexity (Formerly Structure in Complexity …, 1996 | 12 | 1996 |
| Structural average case complexity R Schuler, T Yamakami Journal of Computer and System Sciences 52 (2), 308-327, 1996 | 11 | 1996 |
