Martingales and Locality in Distributed Computing

Devdatt P. Dubhashi

October 1998

Abstract:

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

Available as PostScript, PDF, DVI.

 

Last modified: 2003-06-08 by webmaster.