How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
Realistic analysis of some randomized algorithms
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A time-randomness tradeoff for oblivious routing
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Expected time bounds for selection
Communications of the ACM
Routing, merging and sorting on parallel models of computation
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Polling: a new randomized sampling technique for computational geometry
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Small-bias probability spaces: efficient constructions and applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
In-place techniques for parallel convex hull algorithms (preliminary version)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Design of practical and provably good random number generators
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Chernoff-Hoeffding bounds for applications with limited independence
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A journey into multicomputer routing algorithms
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
| Hi-index | 0.00 |
Randomized algorithms are analyzed as if unlimited amounts of perfect randomness were available, while pseudorandom number generation is usually studied from the perspective of cryptographic security. Bach recently proposed studying the interaction between pseudorandom number generators and randomized algorithms. We follow Bach's lead; we assume that a (small) random seed is available to start up a simple pseudorandom number generator which is then used for the randomized algorithm. We study randomized algorithms for (1) sorting; (2) selection; and (3) oblivious routing in networks.