Optimal randomized algorithms for local sorting and set-maxima

Authors:
W. Goddard;V. King;L. Schulman
Affiliations:
Massachusetts Institute of Technology;University of Toronto;Massachusetts Institute of Technology
Venue:
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Year:
1990

Citing 4
Cited 0

The effect of number of Hamiltonian paths on the complexity of a vertex-coloring problem

SIAM Journal on Computing
Legal coloring of graphs

Combinatorica
Verifying partial orders

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Information Bounds Are Weak in the Shortest Distance Problem

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract