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 | 124 | 2003 |

A Probabilistic 3—SAT Algorithm Further Improved T Hofmeister, U Schöning, R Schuler, O Watanabe Annual Symposium on Theoretical Aspects of Computer Science, 192-202, 2002 | 109 | 2002 |

An algorithm for the satisfiability problem of formulas in conjunctive normal form R Schuler Journal of Algorithms 54 (1), 40-44, 2005 | 98 | 2005 |

DNA-based parallel computation of simple arithmetic H Hug, R Schuler International Workshop on DNA-Based Computers, 321-328, 2001 | 69 | 2001 |

A stochastic approach to count RNA molecules using DNA sequencing methods B Hollas, R Schuler International Workshop on Algorithms in Bioinformatics, 55-62, 2003 | 48 | 2003 |

Improving a probabilistic 3-SAT algorithm by dynamic search and independent clause pairs S Baumer, R Schuler International Conference on Theory and Applications of Satisfiability …, 2003 | 44 | 2003 |

Strategies for the development of a peptide computer H Hug, R Schuler Bioinformatics 17 (4), 364-368, 2001 | 36 | 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 | 29 | 1995 |

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 |

The quantum query complexity of 0-1 knapsack and associated claw problems V Arvind, R Schuler International Symposium on Algorithms and Computation, 168-177, 2003 | 22 | 2003 |

Sets computable in polynomial time on average R Schuler, T Yamakami International Computing and Combinatorics Conference, 400-409, 1995 | 21 | 1995 |

Some properties of sets tractable under every polynomial-time computable distribution R Schuler Information Processing Letters 55 (4), 179-184, 1995 | 20 | 1995 |

Average-case intractability vs. worst-case intractability J Köbler, R Schuler International Symposium on Mathematical Foundations of Computer Science, 493-502, 1998 | 16* | 1998 |

Structural average case complexity R Schuler, T Yamakami International Conference on Foundations of Software Technology and …, 1992 | 16 | 1992 |

Resource-bounded measure and learnability W Lindner, R Schuler, O Watanabe Theory of Computing Systems 33 (2), 151-170, 2000 | 15 | 2000 |

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 |

Randomized algorithms for 3-SAT T Hofmeister, U Schoning, R Schuler, O Watanabe Theory of Computing Systems 40 (3), 249-262, 2007 | 14 | 2007 |

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 |

Structural average case complexity R Schuler, T Yamakami Journal of Computer and System Sciences 52 (2), 308-327, 1996 | 12 | 1996 |

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 | 11 | 1996 |