Martingales and Locality in Distributed Computing

Download PDF
Open Webpage

Devdatt P. Dubhashi

Published: 1998, Last Modified: 15 May 2025FSTTCS 1998EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We use Martingale inequalities to give a simple and uniform analysis of two families of distributed randomised algorithms for edge colouring graphs.