Randomized Algorithms

ACM Computing Surveys

Volumn 28, Issue 1, 1996, Pages 33-37

  Motwani, Rajeev ^a   Raghavan, Prabhakar ^b  

^a Stanford University   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0011690664     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/234313.234327     Document Type: Article

References (30)

1. Aleliunas, R. 1982. Randomized parallel communication. In ACM-SIGOPS Symposium on Principles of Distributed Systems 60-72.
2. Alon, N. and Spencer, J. 1992. The Probabilistic Method. Wiley, New York.
3. Berlekamp, E. R. 1970. Factoring polynomials over large finite fields. Math. Comput. 24, 713-735.
4. Carter, J. L. and Wegman, M. N. 1979. Universal classes of hash functions. J. Comput. Syst. Sci. 18, 2, 143-154.
5. de Leeuw, K., Moore, E. F., Shannon, C. E., and Shapiro, N. 1955. Computability by probabilistic machines. In Automata Studies C. E. Shannon and J. McCarthy, Eds., Princeton University Press, Princeton, NJ, 183-212.
6. Floyd, R. W. and Rivest, R. L. 1975. Expected time bounds for selection. Commun. ACM 18, 165-172.
7. Freivalds, R. 1977. Probabilistic machines can use less running time. in Information Processing 77, Proceedings of IFIP Congress 77, B. Gilchrist, Ed., (Aug.), North-Holland, Amsterdam, 839-842.
8. Gill, J. 1977. Computational complexity of probabilistic Turing machines. SIAM J. Comput. 6, 4 (Dec.), 675-695.
9. Hoare, C. A. R. 1962. Quicksort. Comput. J. 5, 10-15.
10. Jerrum, M. R. and Sinclair, A. 1989.
11. Approximating the permanent. SIAM J. Comput. 18, 6 (Dec.), 1149-1178.
12. Johnson, D. S. 1984a. The NP-completeness column: An ongoing guide. J. Algorithms 5, 284-299.
13. Johnson, D. S. 1984b. The NP-completeness column: An ongoing guide. J. Algorithms 5, 433-447.
14. Karp, R. M. 1991. An introduction to randomized algorithms. Discrete Appl. Math. 34, 165201.
15. Karp, R. M. and Rabin, M. O. 1987. Efficient randomized pattern-matching algorithms. IBM J. Res. Dev. 31 (March), 249-260.
16. Maffioli, F., Speranza, M. G., and Vercellis, C. 1985. Randomized algorithms. in Combinatorial Optimization: Annotated Bibliographies M. O'hEigertaigh, J.K. Lenstra, and A.H.G. Rinooy Kan, Eds., Wiley, New York, 89-105.
17. Motwani, R. and Raghavan, P. 1995. Randomized Algorithms. Cambridge university Press, New York. World-Wide Web information at http://www.cup.org/Reviews&blurbs/RanAlg/RanAlg.html.
18. Mulmuley, K. 1993. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, New York.
19. Mulmuley, K., Vazirani, U. V., and Vazirani, V. v. 1987. Matching is as easy as matrix inversion. Combinatorica 7, 105-113.
20. Rabin, M. O. 1982. The choice coordination problem. Acta Inf. 17, 121-134.
21. Rabin, M. O. 1980. Probabilistic algorithm for testing primality. J. Number Theory 12, 128-138.
22. Rabin, M. O. 1976. Probabilistic algorithms. In Algorithms and Complexity, Recent Results and New Directions J.F. Traub, Ed., Academic Press, New York, 21-39.
23. Rabin, M. O. 1963. Probabilistic automata. Inf. Control 6, 230-245.
24. Sinclair, A. 1992. Algorithms for Random Generation and Counting: A Markov Chain Approach. Progress in Theoretical Computer Science. Birkhauser, Boston.
25. Snir, M. 1985. Lower bounds on probabilistic linear decision trees. Theor. Comput. Sci. 38, 69-82.
26. Solovay, R. and Strassen, V. 1977. A fast Monte-Carlo test for primality. SIAM J. Comput. 6, 1 (March), 84-85. See also SIAM J. Comput. 7, 1 (Feb.), 1978, 118.
27. Upfal, E. 1984. Efficient schemes for parallel communication. J. ACM 31, 507-517.
28. Valiant, L. G. 1982. A scheme for fast parallel communication. SIAM J. Comput. 11, 350-361.
29. Welsh, D. J. A. 1983. Randomised algorithms. Discrete Appl. Math. 5, 133-145.
30. Yao, A. C-C. 1977. Probabilistic computations: Towards a unified measure of complexity. In Proceedings of the 17th Annual Symposium on Foundations of Computer Science 222-227.