Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Randomized minimum spanning tree algorithms using exponentially fewer random bits
ACM Transactions on Algorithms (TALG)
Many random walks are faster than one
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
How Well Do Random Walks Parallelize?
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Algorithms and theory of computation handbook
Fast computation of small cuts via cycle space sampling
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |