Randomized algorithms and pseudorandom numbers

DOI10.1145/174130.174132zbMath0782.68059OpenAlexW1970309382WikidataQ57904594 ScholiaQ57904594MaRDI QIDQ3140013

Prabhakar Raghavan, Howard J. Karloff

Publication date: 6 December 1993

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/174130.174132

zbMATH Keywords

sortingrandomized algorithmsearchingroutingpseudorandom number

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Random number generation in numerical analysis (65C10)

Related Items (10)

Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence ⋮ Randomized geometric algorithms and pseudorandom generators ⋮ Quasi-random rumor spreading: reducing randomness can be costly ⋮ Improved parallel approximation of a class of integer programming problems ⋮ Golden ratio versus pi as random sequence sources for Monte Carlo integration ⋮ The Monte Carlo Algorithm with a Pseudorandom Generator ⋮ Search heuristics and the influence of non-perfect randomness: examining genetic algorithms and simulated annealing ⋮ Improved algorithms via approximations of probability distributions ⋮ A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading ⋮ Primality testing with fewer random bits

This page was built for publication: Randomized algorithms and pseudorandom numbers