Talagrand’s Inequality and Locality in Distributed Computing

Authors

  • Devdatt P. Dubhashi

DOI:

https://doi.org/10.7146/brics.v5i24.19430

Abstract

We illustrate the use of Talagrand's inequality and an extension
of it to dependent random variables due to Marton for the analysis
of distributed randomised algorithms, specifically, for edge colouring
graphs.

Downloads

Published

1998-01-24

How to Cite

Dubhashi, D. P. (1998). Talagrand’s Inequality and Locality in Distributed Computing. BRICS Report Series, 5(24). https://doi.org/10.7146/brics.v5i24.19430

Issue

No. 24 (1998): RS-24 Talagrand’s Inequality and Locality in Distributed Computing

Section

Articles

License

Creative Commons License

Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.