Publication Details
Title: An Introduction to Randomized Algorithms
Author: R. M. Karp
Group: ICSI Technical Reports
Date: June 1990
PDF: http://www.icsi.berkeley.edu/pubs/techreports/tr-90-024.pdf
Overview:
Research conducted over the past fifteen years has amply demonstrated the advantages of algorithms that make random choices in the course of their execution. This paper presents a wide variety of examples intended to illustrate the range of applications of randomized algorithms, and the general principles and approaches that are of greatest use in their construction. The examples are drawn from many areas, including number theory, algebra, graph theory, pattern matching, selection, sorting, searching, computational geometry, combinatorial enumeration, and parallel and distributed computation.
Bibliographic Information:
ICSI Technical Report TR-90-024
Bibliographic Reference:
R. M. Karp. An Introduction to Randomized Algorithms. ICSI Technical Report TR-90-024, June 1990
Author: R. M. Karp
Group: ICSI Technical Reports
Date: June 1990
PDF: http://www.icsi.berkeley.edu/pubs/techreports/tr-90-024.pdf
Overview:
Research conducted over the past fifteen years has amply demonstrated the advantages of algorithms that make random choices in the course of their execution. This paper presents a wide variety of examples intended to illustrate the range of applications of randomized algorithms, and the general principles and approaches that are of greatest use in their construction. The examples are drawn from many areas, including number theory, algebra, graph theory, pattern matching, selection, sorting, searching, computational geometry, combinatorial enumeration, and parallel and distributed computation.
Bibliographic Information:
ICSI Technical Report TR-90-024
Bibliographic Reference:
R. M. Karp. An Introduction to Randomized Algorithms. ICSI Technical Report TR-90-024, June 1990