A faster distributed algorithm for computing maximal matchings deterministically
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Nearly optimal distributed edge colouring in O(log log n) rounds
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
On the distributed complexity of computing maximal matchings
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Fast distributed graph coloring with O(&Dgr;) colors
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Experimental analysis of simple, distributed vertex coloring algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Talagrand's Inequality and Locality in Distributed Computing
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
A Large Deviation Inequality for Functions of Independent, Multi-Way Choices
Combinatorics, Probability and Computing
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Distributed approximation: a survey
ACM SIGACT News
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
A self-stabilizing (Δ+4)-edge-coloring algorithm for planar graphs in anonymous uniform systems
Information Processing Letters
Distributed edge coloration for bipartite networks
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
A 1.43-competitive online graph edge coloring algorithm in the random order arrival model
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Distributed coloring in Õ (√log n) Bit Rounds
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
The Local Nature of List Colorings for Graphs of High Girth
SIAM Journal on Computing
Distributed deterministic edge coloring using bounded neighborhood independence
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
| Hi-index | 0.00 |