Keyword

randomized algorithms

Description: Algorithms that use random choices during computation, often to improve efficiency or achieve useful probabilistic performance guarantees.

Primary topic: Complexity and Algorithms in Graphs (22%)

Wikidata ID: wiki/Q583461

OpenAlex ID: keywords/randomized-algorithms

Introduction to Algorithms

1991 · V. J. Rayward-Smith, Thomas H. Cormen, et al. · Journal of the Operational Research Society · 16,822

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

1997 · Peter W. Shor · SIAM Journal on Computing · 8,450

Simulating physics with computers

1982 · Richard P. Feynman · International Journal of Theoretical Physics · 7,680

Randomized Algorithms

1995 · Rajeev Motwani, Prabhakar Raghavan · Cambridge University Press eBooks · 5,123

PDF

Introduction to Probability Models.

1995 · Flavia Jolliffe, S. M. Ross · Journal of the Royal Statistical Society Series A (Statistics in Society) · 4,525

The Probabilistic Method

1991 · Joel Spencer · Medical Entomology and Zoology · 4,231

Approximate nearest neighbors

1998 · Piotr Indyk, Rajeev Motwani · 4,189

Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions

2011 · N. Halko, P. G. Martinsson, et al. · SIAM Review · 4,031

PDF

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

1999 · Peter W. Shor · SIAM Review · 3,900

PatchMatch

2009 · Connelly Barnes, Eli Shechtman, et al. · ACM Transactions on Graphics · 2,883

Universal classes of hash functions

1979 · J.Lawrence Carter, Mark N. Wegman · Journal of Computer and System Sciences · 2,526

Online Computation and Competitive Analysis

1998 · Allan Borodin, Ran El‐Yaniv · 2,324

Introduction to Algorithms, Second Edition

2001 · Ronald L. Rivest, Charles E. Leiserson, et al. · 1,984

Probability and computing: randomized algorithms and probabilistic analysis

2005 · Mitzenmacher, Michael, Upfal, Eli · CERN Document Server (European Organization for Nuclear Research) · 1,812

Probability and Computing

2005 · Michael Mitzenmacher, Eli Upfal · Cambridge University Press eBooks · 1,736

Fast Probabilistic Algorithms for Verification of Polynomial Identities

1980 · J. T. Schwartz · Journal of the ACM · 1,701

PDF

Computational Complexity

2009 · Sanjeev Arora, Boaz Barak · Cambridge University Press eBooks · 1,687

Epidemic algorithms for replicated database maintenance

1987 · Alan Demers, Dan Greene, et al. · ACM Symposium on Principles of Distributed Computing (PODC) · 1,683

PDF

Simulated Annealing

1993 · Dimitris Bertsimas, John Tsitsiklis · Statistical Science · 1,326

PDF

The Design of Approximation Algorithms

2011 · David P. Williamson, David B. Shmoys · Cambridge University Press eBooks · 1,307

Efficient randomized pattern-matching algorithms

1987 · Richard M. Karp, Michael O. Rabin · IBM Journal of Research and Development · 1,270

The Space Complexity of Approximating the Frequency Moments

1999 · Noga Alon, Yossi Matias, et al. · Journal of Computer and System Sciences · 1,140

Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

1998 · Sanjeev Arora · Journal of the ACM · 1,137

PDF

Probabilistic algorithms for sparse polynomials

1979 · Richard Zippel · Lecture notes in computer science · 1,120

Sampling Large Databases for Association Rules

1996 · Hannu Toivonen · 1,101

Works count: 14,150

Citation count: 319,600