Verifying Partial Orders

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.

Authors

• Claire Mathieu
• Valerie King

Keywords

No keywords are indexed for this paper.