Martingales and Locality in Distributed Computing

Authors

  • Devdatt P. Dubhashi

DOI:

https://doi.org/10.7146/brics.v5i23.19429

Abstract

We use Martingale inequalities to give a simple and uniform analysis of two families of distributed randomised algorithms for edge colouring graphs.

Downloads

Published

1998-01-23

How to Cite

Dubhashi, D. P. (1998). Martingales and Locality in Distributed Computing. BRICS Report Series, 5(23). https://doi.org/10.7146/brics.v5i23.19429

Issue

No. 23 (1998): RS-23 Martingales 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.