共 7 条
[1]
Angluin, Valiant, Fast probabilistic algorithms for Hamiltonian circuits and matchings, Proc. of the Ninth Annual ACM Symposium on the Theory of Computing, pp. 30-41, (1977)
[2]
Bentley, Shamos, Divide-and-conquer in multidimensional space, Proc. of the Eighth Annual ACM Symposium on Theory of Computing, pp. 220-230, (1976)
[3]
Carter, Wegman, Universal classes of hash functions, Proc. of the Ninth Annual ACM Symposium on Theory of Computing, pp. 106-112, (1977)
[4]
Rabin, Probabilistic algorithms, Algorithms and Complexity, (1976)
[5]
Shamos, Geometric Complexity, Proc. of the Seventh Annual ACM Symposium on Theory of Computing, pp. 224-233, (1975)
[6]
Solovay, Strassen, Fast Monte-Carlo test for primality, SIAM Journal on Computing, 6, 1, pp. 84-85, (1977)
[7]
Yuval, Finding nearest neighbours, Information Processing Lett., 5, 3, pp. 63-65, (1976)