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

Nummer

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

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).