Verifying partial orders

Authors:
C. Kenyon-Mathieu;V. King
Affiliations:
Princeton University, Department of Computer Science, Princeton, N. J.;University of Toronto, Department of Computer Science, Toronto, Canada M5S 1A4
Venue:
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Year:
1989

Citing 1
Cited 4

Information Bounds Are Weak in the Shortest Distance Problem

Journal of the ACM (JACM)

Optimal randomized algorithms for local sorting and set-maxima

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Coherent functions and program checkers

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Randomized minimum spanning tree algorithms using exponentially fewer random bits

ACM Transactions on Algorithms (TALG)
Simplifying 3D polygonal chains under the discrete Fréchet distance

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a randomized algorithm which uses O(n(log n)1/3) expected comparisons to verify that a given partial order holds on n elements from an unknown total order.