Martingales and locality in distributed computing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1530 LNCS, Issue , 1998, Pages 174-185

  Dubhashi, Devdatt P ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

[No Author keywords available]

Indexed keywords

EDGE-COLOURING; MARTINGALE INEQUALITIES; RANDOMISED ALGORITHMS;

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE;

SOFTWARE ENGINEERING;

EID: 84887106587     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-49382-2_16     Document Type: Conference Paper

References (13)

1. Bollabas, B. : Graph Theory: An Introductory Course. Springer-Verlag 1980. 176
2. Dubhashi, D., Grable, D.A., and Panconesi, A.: Near optimal distributed edge colouring via the nibble method. Theoretical Computer Science 203 (1998), 225- 251, a special issue for ESA 95, the 3rd European Symposium on Algorithms. 174, 177 (Pubitemid 128457258)
3. Dubhashi, D. and Panconesi, A: Concentration of measure for computer scientists. Draft of a monograph in preparation. 178
4. Grable, D., and Panconesi, A: Near optimal distributed edge colouring in O(log log n) rounds. Random Structures and Algorithms 10, Nr. 3 (1997) 385-405 174, 177
5. Grable, D., and Panconesi, A: Brooks and Vizing Colurings, SODA 98. 184
6. Luby, M.: Removing randomness in parallel without a processor penalty. J. Computer and Systems Sciences 47:2 (1993) 250-286. 176
7. Marton, K.: Bounding d distance by informational divergence: A method to prove measure concentration. Annals of Probability 24 (1996) 857-866.
8. Marton, K.: On the measure concentration inequality of Talagrand for dependent random variables. submitted for publication. (1998).
9. McDiarmid, C.J.H.: On the method of bounded differences. in J. Siemons (ed): Surveys in Combinatorics, London Mathematical Society Lecture Notes Series 141, Cambridge University Press, (1989). 174, 175, 177
10. Molloy, M. and Reed, B.: A bound on the strong chromatic index of a graph. J. Comb. Theory (B) 69 (1997) 103-109. 184 (Pubitemid 127344738)
11. Panconesi, A. and Srinivasan, A.: Randomized distributed edge coloring via an extension of the Chernoff-Hoeffding bounds. SIAM J. Computing 26:2 (1997) 350- 368. 174, 175, 176, 177, 184, 185 (Pubitemid 127652069)
12. Spencer, J.: Probabilistic methods in combinatorics. In proceedings of the International Congress of Mathematicians, Zurich, Birkhauser (1995).
13. Talagrand, M.: Concentration of measure and isoperimetric inequalities in product spaces. Publ. math. IHES, 81:2 (1995) 73-205.