On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Matroid decomposition methods for the set maxima problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
An optimal minimum spanning tree algorithm
Journal of the ACM (JACM)
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)
Monomial bases for broken circuit complexes
European Journal of Combinatorics
Sensitivity analysis of minimum spanning trees in sub-inverse-ackermann time
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
| Hi-index | 0.00 |