Randomized algorithms and pseudorandom numbers
- 1 July 1993
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 40 (3) , 454-476
- https://doi.org/10.1145/174130.174132
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Realistic analysis of some randomized algorithmsJournal of Computer and System Sciences, 1991
- A Time-Randomness Trade-Off for Oblivious RoutingSIAM Journal on Computing, 1990
- On the power of two-point based samplingJournal of Complexity, 1989
- Parallel Merge SortSIAM Journal on Computing, 1988
- Routing, merging, and sorting on parallel models of computationJournal of Computer and System Sciences, 1985
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- The analysis of Quicksort programsActa Informatica, 1977
- Expected time bounds for selectionCommunications of the ACM, 1975
- QuicksortThe Computer Journal, 1962