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
Coloring Algorithms on Subcubic Graphs
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Randomized minimum spanning tree algorithms using exponentially fewer random bits
ACM Transactions on Algorithms (TALG)
Fast computation of small cuts via cycle space sampling
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |