Matroid decomposition methods for the set maxima problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
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)
Hi-index | 0.00 |