Probabilistic recurrence relations

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F130073, Issue , 1991, Pages 190-197

  Karp, Richard M ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; RANDOM VARIABLES;

ANALYSIS OF ALGORITHMS; DIVIDE-AND-CONQUER ALGORITHM; OPTIMAL STRATEGIES; PROBLEM INSTANCES; RECURRENCE RELATIONS; RUNNING TIME; SUB-PROBLEMS; TYPICAL APPLICATION;

PROBABILITY DISTRIBUTIONS;

EID: 84976657416     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/103418.103443     Document Type: Conference Paper

References (5)

1. L.E. Dubins, L.J. Savage, How to Gamble If You Must, McGraw-Hill, New York, 1965.
2. D. Freedman, Another Note on the Borel-Cantelli Lemma and the Strong Law, with the Poisson Approximation as a By-Product, " The Annals of Probability, Vol. 1, No. 6, pp. 910-925, 1973.
3. R, M. Karp, E. Upfal and A, Wlgderson, "The Complexity of Parallel Search, " J. Comput. System. Sci., Vol. 36(2), pp. 225-253, 1988.
4. M. Luby, "A Simple Parallel Algorithm for the Maximal Independent Set Problem, " SIAM J. Comput., Vol. 15, pp. 1036-1053, 1986.
5. G.L. Miller and J .H. Reif, "Parallel Tree Contraction and its Application, " PTOC. 26th Annual IEEE Symp. on Foundations of Computer Science, pp. 478-489, 1985.