Deterministic coin tossing with applications to optimal parallel list ranking
Information and Control
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
On the Distributed Complexity of Computing Maximal Matchings
SIAM Journal on Discrete Mathematics
A simpler linear time 2/3 - ε approximation for maximum weight matching
Information Processing Letters
A linear-time approximation algorithm for weighted matchings in graphs
ACM Transactions on Algorithms (TALG)
The price of being near-sighted
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Improved distributed approximate matching
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Efficient distributed weighted matchings on trees
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
| Hi-index | 0.89 |