skip to main content
article
Free Access

Randomized algorithms and pseudorandom numbers

Published:01 July 1993Publication History
First page image

References

  1. 1 ~BACH, E. Realistic analysis of some randomized algorithms. J. Comput. SysL Scz. 42 (1991), ~30-53. Google ScholarGoogle Scholar
  2. 2 ~aLUM, M., AND MICALI, S. How to generate cryptographically strong pseudo-random bits. ~SIAM J. Computing 13 (1984), 850-864. Google ScholarGoogle Scholar
  3. 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 ScholarGoogle Scholar
  4. 4 ~CARTER, J. L., AND WEGMAN, M. Universal classes of hash functions. J. Comput. Syst. Sci. ~18, 2 (1979), 143-154.Google ScholarGoogle Scholar
  5. 5 ~CHOR, B., AND GOLDREICH, O. The power of two-point sampling. J. Complexity 5 (1989), ~96-106. Google ScholarGoogle Scholar
  6. 6 ~COLE, R. Parallel merge sort. SIAMJ. Comput. 17 (1988), 770-785. Google ScholarGoogle Scholar
  7. 7 ~FELLER, W. An httroduction to ProbabihO' Theoly and Its Apphcatlons, vol. 1. Wiley, New ~York, 1968.Google ScholarGoogle Scholar
  8. 8 ~FLOYD, R. W., AND RIVEST, R.L. Expected time bounds for selection. Commun. ACM 18, 3 ~(Mar. 1975), 165-172. Google ScholarGoogle Scholar
  9. 9 ~HOARE, C. A.R. Quicksort. Comput. J. 5 (1962), 10-15.Google ScholarGoogle Scholar
  10. 10 ~JOFFE, A. On a set of almost deterministic k-independent random variables. Ann. Probab. 2, ~1 (1974), 161-162.Google ScholarGoogle Scholar
  11. 11 ~KNUTH, D. The Art of Computer Programming, vol. 2 (2nd ed.). Addison-Wesley, Menlo Park, ~Calif., 1981, pp. 1-37. Google ScholarGoogle Scholar
  12. 12 ~KNUTH, D. The Art of Computing Programming, vol. 3. Addison-Wesley, Menlo Park, Calif., ~1981, pp. 114-123.Google ScholarGoogle Scholar
  13. 13 ~NIVEN, I., AND ZUCKERMAN, H. The Theory of Numbers (4th ed.). Wiley, New York, 1980, pp. ~224-225.Google ScholarGoogle Scholar
  14. 14 ~PELEG, D., AND UPFAL, E. A time-randomness tradeoff for oblivious routing. SIAM J. ~Comput. 19, 2 (1990), 256-266. Google ScholarGoogle Scholar
  15. 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 ScholarGoogle Scholar
  16. 16 ~REISCHUK, R. Probabilistic parallel algorithms for sorting and selection. SIAM J. Computzng ~14, 2 (1985), 396 409.Google ScholarGoogle Scholar
  17. 17 ~SEDGEWICK, R. The analysis of quicksort programs. Acta Inf. 7 (1981), 327-355.Google ScholarGoogle Scholar
  18. 18 ~STRANG, G. Linear Algebra and Its Applications, 2nd ed. Harcourt Brace Jovanovich, New ~York, 1980.Google ScholarGoogle Scholar
  19. 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 ScholarGoogle Scholar

Index Terms

  1. Randomized algorithms and pseudorandom numbers

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in

              Full Access

              • Published in

                cover image Journal of the ACM
                Journal of the ACM  Volume 40, Issue 3
                July 1993
                369 pages
                ISSN:0004-5411
                EISSN:1557-735X
                DOI:10.1145/174130
                Issue’s Table of Contents

                Copyright © 1993 ACM

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 1 July 1993
                Published in jacm Volume 40, Issue 3

                Permissions

                Request permissions about this article.

                Request Permissions

                Check for updates

                Qualifiers

                • article

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader
              About Cookies On This Site

              We use cookies to ensure that we give you the best experience on our website.

              Learn more

              Got it!