An improved parallel algorithm for maximal matching
Information Processing Letters
A simple parallel algorithm for the maximal independent set problem
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Efficient parallel algorithms for edge coloring problems
Journal of Algorithms
Parallel symmetry-breaking in sparse graphs
SIAM Journal on Discrete Mathematics
Probabilistic recurrence relations
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Locality in distributed graph algorithms
SIAM Journal on Computing
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Removing randomness in parallel computation without a processor penalty
Journal of Computer and System Sciences
Randomized algorithms
SIAM Journal on Computing
Fast distributed construction of k-dominating sets and applications
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
On the complexity of distributed network decomposition
Journal of Algorithms
Nearly optimal distributed edge coloring in O(log log n) rounds
Random Structures & Algorithms
Probabilistic recurrence relations revisited
Theoretical Computer Science - Special issue: Latin American theoretical informatics
Distributed Algorithms
A faster distributed algorithm for computing maximal matchings deterministically
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
A near-optimal real-time hardware scheduler for large cardinality crossbar switches
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Complexity in wireless scheduling: impact and tradeoffs
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
A two-stage hardware scheduler combining greedy and optimal scheduling
Journal of Parallel and Distributed Computing
A simple local 3-approximation algorithm for vertex cover
Information Processing Letters
Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
A Self-stabilizing Approximation Algorithm for Vertex Cover in Anonymous Networks
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A local 2-approximation algorithm for the vertex cover problem
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Distributed algorithms for edge dominating sets
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Distributed algorithm for a color assignment on asynchronous rings
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Why locally-fair maximal flows in client-server networks perform well
Journal of Combinatorial Optimization
Brief announcement: distributed approximations for the semi-matching problem
DISC'11 Proceedings of the 25th international conference on Distributed computing
Efficient distributed handshake using mobile agents
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
End-to-end throughput with cooperative communication in multi-channel wireless networks
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
Distributed maximal matching: greedy is optimal
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Distributed 2-approximation algorithm for the semi-matching problem
DISC'12 Proceedings of the 26th international conference on Distributed Computing
ACM Computing Surveys (CSUR)
Exploiting locality in distributed SDN control
Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking
| Hi-index | 0.00 |