A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
The complexity of parallel search
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Designing synchronous algorithms for asynchronous processors
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A faster distributed algorithm for computing maximal matchings deterministically
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Proceedings of the seventh 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
Experimental analysis of simple, distributed vertex coloring algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Routing in Networks with Long Range Contacts
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
ACM-SE 33 Proceedings of the 33rd annual on Southeast regional conference
A simple expected running time analysis for randomized "divide and conquer" algorithms
Discrete Applied Mathematics
GRaSP: generalized range search in peer-to-peer networks
Proceedings of the 3rd international conference on Scalable information systems
Discrete Applied Mathematics
O(log n)-time overlay network construction from graphs with out-degree 1
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
| Hi-index | 0.00 |