Martingales and Locality in Distributed Computing

Forfattere

  • Devdatt P. Dubhashi

DOI:

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

Resumé

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

Downloads

Publiceret

1998-01-23

Citation/Eksport

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