Skip to main content
SpringerLink
Log in

Randomized algorithms: An annotated bibliography

In alphabetical order

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. L. Adleman, Two theorems on random polynomial time, Proc. 19th Symp. Found. Comp. Sc. (1980) p. 75.

  2. L. Adleman, On distinguishing prime numbers from composite numbers, Proc. 21st Symp. Found. Comp. Sc. (1980) p. 387.

  3. L. Adleman and K. Manders, Reducibility, randomness and intractability, Proc. 9th ACM Symp Theory Comput. (1977) p. 151.

  4. R. Aleliunas, R. Karp, R. Lipton, L. Lovász and C. Rackoff, Random walks, universal sequences and the complexity of maze problems, Proc. 20th Found. Comp. Sc. (1979) p. 218.

  5. D. Angluin and L.G. Valiant, Fast probabilistic algorithms for hamiltonian circuits and matchings, J. Comp. and Syst. Sc. 18(1979) 155.

    Google Scholar 

  6. A.O.L. Atkin and R.G. Larson, On a primality test of Solovay and Strassen, SIAM J. Comput. 11(1982) 789.

    Google Scholar 

  7. L. Babai, Monte-Carlo algorithms in graph isomorphism testing, Rapports de Recherches du Departement de Mathematiques et de Statistique, D.M.S., Nr. 79-10, C.P. 6128, Succ. A′ (Montreal, Quebec H3C 3J7, 1979).

  8. T. Baker, J. Gill and R. Solovay, Relativization of theP≟NP question, SIAM J. Comput 4(1975) 431.

    Google Scholar 

  9. J.M. Barzdin, On the frequency solution of algorithmically unsolvable mass problems, Dokl. Akad. Nauk. SSSR 191(1970) 967.

    Google Scholar 

  10. M. Becker, W. Degenhardt, J. Doenhardt, S. Hertel, G. Kaninke, W. Weber, K. Mehlhorn, S. Naher, H. Rohnert and T. Winter, A probabilistic algorithm for vertex connectivity of graphs, Inf. Proc. Lett. 15(1982) 135.

    Google Scholar 

  11. C.H. Bennett and J. Gill, Relative to a random oracleA, P A ≠NP A ≠ co -NP A with probability 1, SIAM J. Comput. 10(1981) 96.

    Google Scholar 

  12. E.R. Berlekamp, Factoring polynomials over large finite fields, Math. Comput. 24(1970) 713.

    Google Scholar 

  13. M. Blum, A.K. Chandra and M.N. Wegman, Equivalence of free boolean graphs can be decided probabilistically in polynomial time, Inf. Proc. Lett. 10(1980) 80.

    Google Scholar 

  14. J. Calmet and R. Loos, An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials overGF(p), Inf. Proc. Lett. 11(1980) 94.

    Google Scholar 

  15. J.L. Carter and M.N. Wegman, Universal classes of hash functions, Proc. 9th ACM Symp. Theory Comput. (1977) p. 106.

  16. G.J. Chaitin, Algorithmic information theory. IBM J. Res. Develop. 21(1977) 350.

    Google Scholar 

  17. G.J. Chaitin and J.T. Schwartz, A note on Monte-Carlo primality tests and algorithmic information theory. Commun. Pure Appl. Math. 31(1978) 521.

    Google Scholar 

  18. D.G. Dannenbring, Procedures for estimating optimal solution values for large combinatorial problems, Manag. Sci. 23(1977) 1273.

    Google Scholar 

  19. P.J. Davis, Proof, completeness, transcendentals and sampling, J. ACM 24(1977) 298.

    Google Scholar 

  20. S. Fortune and J. Hopcroft, A note on Rabin's nearest neighbor algorithm, Inf. Proc. Lett. 8(1979) 20.

    Google Scholar 

  21. W.D. Frazer and A.C. McKellar, Samplesort: a sampling approach to minimal storage tree sorting. J. ACM 17(1970) 496.

    Google Scholar 

  22. M.L. Freedman, Two applications of a probabilistic search technique: sortingx+y and building balanced search trees, Proc. 7th ACM Symp. Theory Comput. (1975) p. 240.

  23. R. Freivalds, Probabilistic machines can use less running time, Inf. Proc. 77, ed. B. Gilchrist (North-Holland, Amsterdam, 1977) p. 839.

    Google Scholar 

  24. R. Freivalds, Recognition of languages with high probability of different classes of automata, Soviet Math. Dokl. 19(1978) 295.

    Google Scholar 

  25. R. Freivalds, Fast probabilistic algorithms, Math. Found. Comp. Sci. (Springer, Berlin, 1979) p. 57.

    Google Scholar 

  26. R. Freivalds, Projections of languages recognizable by probabilistic and alternating finite multitape automata, Inf. Proc. Lett. 13(1981) 195.

    Google Scholar 

  27. R. Freivalds, Probabilistic two-way machines, Lecture Notes in Comp. Sci. 118(1981) 33.

    Google Scholar 

  28. J.T. Gill, Computational complexity of probabilistic Turing machines, SIAM J. Comput. 6(1977) 675.

    Google Scholar 

  29. B.L. Golden, A statistical approach to the TSP, Networks 7(1977) 209.

    Google Scholar 

  30. B.L. Golden and F.B. Alt, Interval estimation of a global optimum for large combinatorial problems, Nav. Res. Log. Quart. 26(1979) 69.

    Google Scholar 

  31. G.R. Grimmett and C.J.H. McDiarmid, On colouring random graphs, Math. Proc. Camb. Phil. Soc. 77(1975) 313.

    Google Scholar 

  32. J. Heintz and M. Sieveking, Absolute primality of polynomials is decidable in random polynomial time in the number of, variables, Lecture, Notes Comp. Sci. 115 (Springer, Berlin, 1981) p. 16.

    Google Scholar 

  33. T. Herlestam, A note on Rabin's probabilistic primality test, BIT 20(1980) 518.

    Google Scholar 

  34. C.A.R. Hoare, Quicksort, Comput. J. 5(1962) 10.

    Google Scholar 

  35. J. Hopcroft, Recent directions in algorithmic research, Proc. 5th Conf. Theor. Comp. Sci., ed. P. Deussen (Springer, Berlin, 1981) p. 123.

    Google Scholar 

  36. O.H. Ibarra and S. Moran, Determinstic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication, Inf. Proc. Lett. 13(1981) 12.

    Google Scholar 

  37. O.H. Ibarra and S. Moran, Probabilistic algorithms for deciding equivalence of straight line programs, J. ACM 30(1983) 217.

    Google Scholar 

  38. O.H. Ibarra, L. Roster and S. Moran, Probabilistic algorithms and straight line programs for some rank decision problems, Inf. Proc. Lett. 12(1981) 227.

    Google Scholar 

  39. A. Itai, A randomized algorithm for checking equivalence of circular lists, Inf. Proc. Lett. 9(1979) 118.

    Google Scholar 

  40. A. Itai and M. Rodeh, Covering a graph by circuits, Springer Lect. Notes Comput. Sci. 62 (Springer-Verlag, Berlin, 1978) p. 289.

    Google Scholar 

  41. W. Janko, A list insertion sort for keys with arbitrary key distribution, ACM Trans. Math. Soft. 2(1976) 143.

    Google Scholar 

  42. W. Janko, An insertion sort for uniformly distributed keys based on stopping theory, Proc. Int. Comput. Symp., ed. E. Horlet and D. Ribbens (North-Holland, Amsterdam, 1977) p. 373.

    Google Scholar 

  43. W. Janko, Probabilistic algorithms and the efficient use of statistical models of decision in their design, Math. Oper. Res. 36(1980) 165.

    Google Scholar 

  44. H. Jung, Relationships between probabilistic and deterministic tape complexity, Math. Found. Comp. Sci. (Springer, Berlin, 1981) p. 339.

    Google Scholar 

  45. R.M. Karp, The probabilistic analysis of some combinatorial search algorithms, Algorithms and Complexity, ed. J.F. Traub (Academic Press, New York, 1976) p. 1.

    Google Scholar 

  46. R.M. Karp and R. Lipton, Some connections between non-uniformal and uniformal complexity classes, Proc. 12th ACM Symp. on Theory of Comput (1980) p. 302.

  47. Ker-I Ko, Some observations on the probabilistic algorithms and NP-hard problems, Inf. Proc. Lett. 14(1982) 39.

    Google Scholar 

  48. D. Kozen, Semantics of probabilistic programs, Proc. 20th Symp. Found. Comput. Sci. (1979) p. 104.

  49. S.L. Kurtz, On the random oracle hypothesis, Proc. 14th ACM Symp. Theory Comput. (1982) p. 224.

  50. R. Ladner, On the structure of polynomial time reducibility, J. ACM 22(1975) 155.

    Google Scholar 

  51. C. Lardinois, Methodes statistiques en optimisation combinatoire, Res. Rep. Nr. 116 (Université de Montreal, Centre de Recherche sur les transports, 1979).

  52. K. de Leeuw, E.F. Moore, C.E. Shannon and N. Shapiro, Computability by probabilistic machines, Automata Studies, ed. C.E. Shannon and J. McCarthy (Princeton University Press, Princeton, 1955) p. 183.

    Google Scholar 

  53. D.L. Lehmann, On primality tests, SIAM J. Comput. 11(1982)374.

    Google Scholar 

  54. D.L. Lehmann and M.O. Rabin, On the advantage of free choice: a symmetric and fully distributed solution to the dining philosophers problems, Proc. 8th ACM Symp. Princ. Progr. Lang. (1981) p. 133.

  55. T. Leighton and M. Lepley, Probabilistic searching in sorted linked lists, Proc. 20th Allerton Conf. Comm. Contr. Comput. (1982) p. 500.

  56. S. Lin, Computer solutions of the traveling salesman problem, B.S.T.J. 44(1965)2245.

    Google Scholar 

  57. L. Lovász, On determinants, matchings and random algorithms, unpublished memo.

  58. G.S. Lueker, Algorithms with random input, Proc. 13th Symp. Interface, ed. W.F. Eddy (Springer Verlag, New York, 1981) p. 68.

    Google Scholar 

  59. F. Maffioli, Couplages et matroides, in: Regards sur la théorie des graphes, ed. P. Hansen and D. de Werra (Presses Polytechniques Romandes, 1980) p. 97.

  60. K.L. McRoberts, A search model for evaluating combinatorially explosive problems, Oper. Res. 19(1971)1331.

    Google Scholar 

  61. K. Mehlhorn and E.M. Schmidt, Las Vegas is better than determinism in VLSI and distributed computing, Proc. 14th ACM Symp. Theory Comput. (1982) p. 330.

  62. G.L. Miller, Riemann's hypothesis and tests for primality, Proc. 7th ACM Symp. Theory Comput. (1975) p. 234.

  63. C.H. Papadimitriou and K. Steiglitz, Combinatorial optimization: Algorithms and Complexity (Prentice Hall, Englewood Cliffs, 1982).

    Google Scholar 

  64. N. Pippenger, Probabilistic simulation, Proc. 14th ACM Symp. Theory Comput. (1982) p. 17.

  65. J.M. Pollard, A Monte-Carlo method for factorization, BIT 15(1975)331.

    Google Scholar 

  66. L. Posa, Hamiltonian circuits in random graphs, Discr. Math. 14(1976)359.

    Google Scholar 

  67. M.O. Rabin, Probabilistic automata, Inf. Control 6(1963)230.

    Google Scholar 

  68. M.O. Rabin, Probabilistic algorithms, algorithms and complexity, in: new directions and recent results, ed. J. Traub (Academic Press, New York, 1976) p. 21.

    Google Scholar 

  69. M.O. Rabin, Complexity of computations, Commun. ACM 20(1977)623.

    Google Scholar 

  70. M.O. Rabin, Probabilistic algorithms, IBM Research Division, San Jose-Yorktown-Zurich, Report RC 6164(1979).

    Google Scholar 

  71. M.O. Rabin, Probabilistic algorithms in finite fields, SIAM J. Comput. 9(1980)273.

    Google Scholar 

  72. M.O. Rabin, Probabilistic algorithms for testing primality, J. Number Theory 12(1980)128.

    Google Scholar 

  73. M.O. Rabin, Fingerprinting by random polynomials, Research Report TR-15-81, Aiken Computation Laboratory, Harvard University (1981).

  74. M.O. Rabin,N-process synchronisation by a 4 logN-valued shared variable. J. Comp. Syst. Sci. 25(1982)66.

    Google Scholar 

  75. C. Rackoff, Relativized questions involving probabilistic algorithms, J. ACM 29(1982)261.

    Google Scholar 

  76. J.H. Reif, Logics for probabilistic programming, Proc. 12th ACM Symp. Theory Comput. (1980) p. 8.

  77. J.H. Reif, On the power of probabilistic choice in synchronous parallel computations, Proc. ICALP, ed. M. Nielsen and E.M. Schmidt (Springer Verlag, Berlin, 1982) p. 442.

    Google Scholar 

  78. J.H. Reif and P.G. Spirakis, Probabilistic analysis of random extension—rotation algorithms, Res. Rep. TR-28-81 (Aiken Computation Laboratory, Harvard University, 1981).

  79. J.H. Reif and L. Valiant, A logarithmic-time sort for linear size networks, Proc. 15th ACM Symp. Theory Comput. (1983) p. 10.

  80. R. Reischuk, A fast probabilistic parallel sorting algorithm, Proc. 22th Symp. Found. Comput. Sci. (1981) p.

  81. S. Reiter and G. Sherman, Discrete optimizing, SIAM J. 13(1965)864.

    Google Scholar 

  82. F.J. Rohlf, A probabilistic minimum spanning tree algorithm, Inf. Proc. Lett. 7(1978) 44.

    Google Scholar 

  83. R. Roth, Computer solutions to minimum-cover problems, Oper. Res. 17(1969)455.

    Google Scholar 

  84. R. Roth, An approach to solving linear discrete optimization problems. J. ACM 17(1970) 303.

    Google Scholar 

  85. V.L. Ruzzo, J. Simon and M. Tompa, Space-bounded hierarchies and probabilistic computations, Proc. 14th ACM Symp. Theory Comput. (1982) p. 215.

  86. E.S. Santos, Probabilistic Turing machines and computability, Proc. Amer. Math. Soc. 22 (1969) p.704.

    Google Scholar 

  87. E.S. Santos, Computability by probabilistic Turing machines, Trans. Amer. Math. Soc. 4 (1971)165.

    Google Scholar 

  88. S.L. Savage, Some theoretical implications of local optimization, Math. Progr 10(1976)354.

    Google Scholar 

  89. J.T. Schwartz, Fast probabilistic algorithms for verification of polynomial identies, J. ACM 27(1980)701.

    Google Scholar 

  90. R. Sedqewick, The analysis of quicksort programs, Acta Inf. 7(1977)327.

    Google Scholar 

  91. J. Simon, On the difference between the one and the many, Automata Languages and Programming, Springer Lecture Notes in Comp. Sc. 52(1977) p. 480.

    Google Scholar 

  92. J. Simon, Space-bounded probabilistic Turing machine complexity classes are closed under complement, Proc. 13th ACM Symp. Theory Comput. (1981) p. 158.

  93. R.C. Singleton, Algorithm A 347: an efficient algorithm for sorting with minimal storage, Comm. ACM 12(1969)185.

    Google Scholar 

  94. R. Solovay and V. Strassen, A fast Monte-Carlo test for primality, SIAM J. Comput. 6 (1977)84.

    Google Scholar 

  95. R. Solovay and V. Strassen, Erratum: A fast Monte-Carlo test for primality, SIAM J. Comput. 7(1978)118.

    Google Scholar 

  96. K.P. Steiglitz, P. Weiner and D.J. Kleitman, The design of minimal cost survivable networks, IEEE Trans. Cir. Theory, CT 16(1969) p. 455.

    Google Scholar 

  97. L.J. Stockmeyer, The polynomial-time hierarchy, Theor. Comp. Sc. 3(1977)1.

    Google Scholar 

  98. B.A. Trakhtenbrot, On problems solvable by successive trials, Proc. Math. Found. Comput. Sci., ed. G. Goos and J. Hartmanis (Springer-Verlag, Berlin, 1975) p. 125.

    Google Scholar 

  99. L.G. Valiant, The complexity of enumeration and reliability problems, SIAM J. Comput. 8(1979)410.

    Google Scholar 

  100. C. Vercellis, A probabilistic stopping rule for randomized algorithms, Res. Rep. Nr. 81. 2 (Ist. App. Mat. Inf.), CNR, Milano, 1981).

    Google Scholar 

  101. C. Vercellis, A probabilistic analysis of the set covering problem, Res. Rep. No. 82.9 (Ist. Appl. Mat. Inf.), CNR, Milano, 1982).

    Google Scholar 

  102. B.W. Weide, Statistical methods in algorithmic design and analysis, Ph.D. Thesis (Carnegie-Mellon University, Pittsburgh, PA, Computer Sci. Dept.) Report CMU-CS-78-142 (1978).

    Google Scholar 

  103. D.J.A. Welsh, Randomized algorithms, Discr. Appl. Math. 5(1983)133.

    Google Scholar 

  104. H.C. Williams, Primality testing on a computer, Ars Combinatorica 5(1978)127.

    Google Scholar 

  105. Y. Yacobi and S. Even, A hard-core theorem for randomized algorithms, Tech. Rep. Nr. 188 (Computer Sci. Dept., Technion, 1980).

  106. A.C. Yao, A lower bound to palindrome recognition by probabilistic Turing machines (Stanford University, Stanford, California, Computer Sci. Dept., Rep. STAN-CS-77-647, 1977).

    Google Scholar 

  107. A.C. Yao, Probabilistic computations: toward a unified measure of complexity, Proc. 18th Symp. Found. Comput Sci. (1977) p. 222.

  108. R.E. Zippel, Probabilistic algorithms for sparse polynomials, Springer Lecture Notes in Comput. Sci. 72(1979) p. 216.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Elettronica, Politecnico di Milano, Piazza L. da Vinci 32, I-20133, Milano, Italy

    E. Maffioli

  2. Dipartimento di Matematica, Università di Milano, via L. Cicognara 7, I-20129, Milano, Italy

    M. G. Speranza & C. Vercellis

Authors
  1. E. Maffioli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. G. Speranza
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. C. Vercellis
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Closing date of bibliography: January 1984.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Maffioli, E., Speranza, M.G. & Vercellis, C. Randomized algorithms: An annotated bibliography. Ann Oper Res 1, 331–345 (1984). https://doi.org/10.1007/BF01874396

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01874396

Keywords

Search

Navigation