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 algorithms for Brooks-Vizing colourings
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
Explicit constructions of selectors and related combinatorial structures, with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed coloring and communication in rings with local knowledge
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
End-to-end packet-scheduling in wireless ad-hoc networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed Colouring and Communication in Rings with Local Knowledge
Combinatorics, Probability and Computing
On the complexity of distributed graph coloring
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Fast deterministic distributed algorithms for sparse spanners
Theoretical Computer Science
Fast distributed scheduling via primal-dual
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
r3: Resilient Random Regular Graphs
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Distributed (δ+1)-coloring in linear (in δ) time
Proceedings of the forty-first annual ACM symposium on Theory of computing
Weak graph colorings: distributed algorithms and applications
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Local computation of nearly additive spanners
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Deterministic distributed vertex coloring in polylogarithmic time
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Deploying wireless networks with beeps
DISC'10 Proceedings of the 24th international conference on Distributed computing
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
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Toward more localized local algorithms: removing assumptions concerning global knowledge
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Distributed deterministic edge coloring using bounded neighborhood independence
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Deterministic Distributed Vertex Coloring in Polylogarithmic Time
Journal of the ACM (JACM)
Beeping a maximal independent set
DISC'11 Proceedings of the 25th international conference on Distributed computing
Combinatorial algorithms for distributed graph coloring
DISC'11 Proceedings of the 25th international conference on Distributed computing
Fast deterministic distributed algorithms for sparse spanners
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Distributed algorithms for scheduling on line and tree networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
On the locality of some NP-complete problems
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Deterministic distributed construction of linear stretch spanners in polylogarithmic time
DISC'07 Proceedings of the 21st international conference on Distributed Computing
On the complexity of distributed greedy coloring
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Distributed computing with advice: information sensitivity of graph coloring
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Randomized distributed decision
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Towards a complexity theory for local distributed computing
Journal of the ACM (JACM)
Fast distributed coloring algorithms for triangle-free graphs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |