1. Fast probabilistic algorithms for hamiltonian circuits and matchings;Angluin,1977
2. Sensitivity to instance distribution of algorithms for solving satisfiability and other NP-hard problems;Franco,1981
3. Average case complexity of the satisfiability problem;Goldberg;Proc. 4th Workshop on Automated Deduction,1979
4. The probabilistic analysis of some combinatorial search algorithms;Karp,1976