
- 1 ~BACH, E. Realistic analysis of some randomized algorithms. J. Comput. SysL Scz. 42 (1991), ~30-53. Google Scholar
- 2 ~aLUM, M., AND MICALI, S. How to generate cryptographically strong pseudo-random bits. ~SIAM J. Computing 13 (1984), 850-864. Google Scholar
- 3 ~BORODIN, A., AND HOPCROFT, J. E. Routing, merging and sorting on parallel models of ~computation. J. Comput. Syst. Sci. 30 (1985), 130-145. Google Scholar
- 4 ~CARTER, J. L., AND WEGMAN, M. Universal classes of hash functions. J. Comput. Syst. Sci. ~18, 2 (1979), 143-154.Google Scholar
- 5 ~CHOR, B., AND GOLDREICH, O. The power of two-point sampling. J. Complexity 5 (1989), ~96-106. Google Scholar
- 6 ~COLE, R. Parallel merge sort. SIAMJ. Comput. 17 (1988), 770-785. Google Scholar
- 7 ~FELLER, W. An httroduction to ProbabihO' Theoly and Its Apphcatlons, vol. 1. Wiley, New ~York, 1968.Google Scholar
- 8 ~FLOYD, R. W., AND RIVEST, R.L. Expected time bounds for selection. Commun. ACM 18, 3 ~(Mar. 1975), 165-172. Google Scholar
- 9 ~HOARE, C. A.R. Quicksort. Comput. J. 5 (1962), 10-15.Google Scholar
- 10 ~JOFFE, A. On a set of almost deterministic k-independent random variables. Ann. Probab. 2, ~1 (1974), 161-162.Google Scholar
- 11 ~KNUTH, D. The Art of Computer Programming, vol. 2 (2nd ed.). Addison-Wesley, Menlo Park, ~Calif., 1981, pp. 1-37. Google Scholar
- 12 ~KNUTH, D. The Art of Computing Programming, vol. 3. Addison-Wesley, Menlo Park, Calif., ~1981, pp. 114-123.Google Scholar
- 13 ~NIVEN, I., AND ZUCKERMAN, H. The Theory of Numbers (4th ed.). Wiley, New York, 1980, pp. ~224-225.Google Scholar
- 14 ~PELEG, D., AND UPFAL, E. A time-randomness tradeoff for oblivious routing. SIAM J. ~Comput. 19, 2 (1990), 256-266. Google Scholar
- 15 ~RANADE, A. How to emulate shared memory. In Proceedings of the 28th IEEE Symposium on ~Foundations of Computer Science. IEEE, New York, 1987, pp. 185-194.Google Scholar
- 16 ~REISCHUK, R. Probabilistic parallel algorithms for sorting and selection. SIAM J. Computzng ~14, 2 (1985), 396 409.Google Scholar
- 17 ~SEDGEWICK, R. The analysis of quicksort programs. Acta Inf. 7 (1981), 327-355.Google Scholar
- 18 ~STRANG, G. Linear Algebra and Its Applications, 2nd ed. Harcourt Brace Jovanovich, New ~York, 1980.Google Scholar
- 19 ~VALItMNT, L. G., ^ND BREDiNEiX, G. J. Uni'~craal achcmca for parallel communication. In ~Proceedings of the 13th ACM Symposium on Theory of Computing (Milwaukee, Wis., May ~11-13). ACM, New York, 1981, pp. 263-277. Google Scholar
Index Terms
Randomized algorithms and pseudorandom numbers
Recommendations
Faster deterministic sorting and searching in linear space
FOCS '96: Proceedings of the 37th Annual Symposium on Foundations of Computer ScienceWe present a significant improvement on linear space deterministic sorting and searching. On a unit-cost RAM with word size w, an ordered set of n w-bit keys (viewed as binary strings or integers) can be maintained in O(min{[/spl radic/(logn)][logn/logw+...
Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm
In this article, we describe a randomized Shellsort algorithm. This algorithm is a simple, randomized, data-oblivious version of the Shellsort algorithm that always runs in O(n log n) time and succeeds in sorting any given input permutation with very ...
Work-Time Optimal k-Merge Algorithms on the PRAM
For 2 k n, the k-merge problem is to merge a collection of k sorted sequences of total length n into a new sorted sequence. The k-merge problem is fundamental as it provides a common generalization of both merging and sorting. The main contribution of ...






Comments