Talagrand’s Inequality and Locality in Distributed Computing

Forfattere

  • Devdatt P. Dubhashi

DOI:

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

Resumé

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

Publiceret

1998-01-24

Citation/Eksport

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