A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
A simple parallel algorithm for the maximal independent set problem
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Constant-time distributed dominating set approximation
Proceedings of the twenty-second annual symposium on Principles of distributed computing
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Distributed approximation: a survey
ACM SIGACT News
Facility location: distributed approximation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
A distributed O(1)-approximation algorithm for the uniform facility location problem
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Distributed approximation of capacitated dominating sets
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
What can be approximated locally?: case study: dominating sets in planar graphs
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Parallel approximation algorithms for facility-location problems
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Rapid randomized pruning for fast greedy distributed algorithms
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Distributed graph coloring in a few rounds
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Centrality-driven scalable service migration
Proceedings of the 23rd International Teletraffic Congress
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Super-fast distributed algorithms for metric facility location
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
A Local Heuristic for Latency-Optimized Distributed Cloud Deployment
UCC '13 Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing
| Hi-index | 0.00 |