Matroid decomposition methods for the set maxima problem

Authors:
Vincenzo Liberatore
Affiliations:
Department of Computer Science, Hill Center, Rutgers University, New Brunswick, NJ
Venue:
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Year:
1998

Citing 6
Cited 2

A linear approach to the set maxima problem

SIAM Journal on Discrete Mathematics
Optimal randomized algorithms for local sorting and set-maxima

SIAM Journal on Computing
A randomized linear-time algorithm for finding minimum spanning trees

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A randomized linear-time algorithm to find minimum spanning trees

Journal of the ACM (JACM)
Applications of Path Compression on Balanced Trees

Journal of the ACM (JACM)
Information Bounds Are Weak in the Shortest Distance Problem

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)

Quantified Score

Hi-index	0.00

Visualization

Abstract