Add to ORKGWe use Martingale inequalities to give a simple and uniform analysis of two families of distributed randomised algorithms for edge colouring graphs
Extended abstract in Proceedings of the 11th ACM Symposium on Principles of Distributed Computing (...
AbstractWe develop some general techniques for converting randomized parallel algorithms into determ...
We present new bounds on the locality of several classical symmetry breaking tasks in dis-tributed n...
We illustrate the use of Talagrand's inequality and an extensionof it to dependent random variables ...
Abstract. This paper concerns a number of algorithmic problems on graphs and how they may be solved ...
International audienceSurvey of core results in the context of locality in distributed graph algorit...
Randomness is well-recognized as an important computational resource in theoretical computer scienc...
International audienceIn this paper, we carry on investigating the line of research questioning the ...
International audienceWe carry on investigating the line of research questioning the power of random...
The theory of distributed computing aims at understanding which tasks can be solved efficiently in l...
Certain types of routing, scheduling and resource allocation problems in a distributed setting can ...
This paper presents a simple load balancing algorithm and its probabilistic analysis. Unlike most of...
AbstractWe present and analyse a very simple randomised distributed vertex colouring algorithm for a...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1995.Includes bibliogr...
We present a constant-time randomized distributed algorithms in the congested clique model that comp...
Extended abstract in Proceedings of the 11th ACM Symposium on Principles of Distributed Computing (...
AbstractWe develop some general techniques for converting randomized parallel algorithms into determ...
We present new bounds on the locality of several classical symmetry breaking tasks in dis-tributed n...
We illustrate the use of Talagrand's inequality and an extensionof it to dependent random variables ...
Abstract. This paper concerns a number of algorithmic problems on graphs and how they may be solved ...
International audienceSurvey of core results in the context of locality in distributed graph algorit...
Randomness is well-recognized as an important computational resource in theoretical computer scienc...
International audienceIn this paper, we carry on investigating the line of research questioning the ...
International audienceWe carry on investigating the line of research questioning the power of random...
The theory of distributed computing aims at understanding which tasks can be solved efficiently in l...
Certain types of routing, scheduling and resource allocation problems in a distributed setting can ...
This paper presents a simple load balancing algorithm and its probabilistic analysis. Unlike most of...
AbstractWe present and analyse a very simple randomised distributed vertex colouring algorithm for a...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1995.Includes bibliogr...
We present a constant-time randomized distributed algorithms in the congested clique model that comp...
Extended abstract in Proceedings of the 11th ACM Symposium on Principles of Distributed Computing (...
AbstractWe develop some general techniques for converting randomized parallel algorithms into determ...
We present new bounds on the locality of several classical symmetry breaking tasks in dis-tributed n...