Probabilistic recurrence relations revisited

Theoretical Computer Science

Volumn 181, Issue 1, 1997, Pages 45-56

  Chaudhuri, Shiva ^a   Dubhashi, Devdatt ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FUNCTIONS; MARKOV PROCESSES; PROBABILITY; PROBLEM SOLVING; THEOREM PROVING;

CHERNOFF BOUNDS;

PROBABILISTIC LOGICS;

EID: 0031191838     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00261-7     Document Type: Article

References (8)

1. M. Dietzfelbinger and F. Meyer auf der Heide, A new universal class of hash functions and dynamic hashing in real time, 17th ICALP, Lecture Notes in Computer Science, Vol. 443 (Springer, Berlin, 1990) 6-19.
2. D. Dubhashi, D. Grable and A. Panconesi, Near optimal distributed edge colouring via the Nibble method, Theoret. Comput. Sci. (special issue), to appear.
3. R.M. Karp, Probabilistic recurrence relations, J. ACM 41 (1994) 1136-1150.
4. R.M. Karp, E. Upfal and A. Wigderson, The complexity of parallel search, J. Comput. System Sci. 36 (1988) 225-253.
5. M. Luby, A simple parallel algorithm for the maximal independent set problem, SIAM J. Comput. 15 (1986) 1036-1053.
6. I.W. Marshall and I. Olkin, Inequalities: Theory of Majorization and its Applications (Academic Press, New York, 1979).
7. A. Panconesi and A. Srinivasan, Fast randomized algorithms for distributed edge coloring, in: Proc. ACM Symp. on Principles of Distributed Computing (1992) 251-262.
8. R. Raman, The power of collision: randomized parallel algorithms for chaining and integer sorting, in: Proc. 10th Ann. FST&TCS Conf. Lecture Notes in Computer Science, Vol. 472 (Springer, Berlin, 1990) 161-175.