Talagrand’s Inequality and Locality in Distributed Computing
AbstractWe 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
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
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.