Under the promise that the convex hull vertices form a subsequence of the input, the hull can be computed in O(n sqrt(log n)) deterministic time or O(n log^ε n) expected time, and the promise is tight because even one out-of-order hull point forces an Omega(n log n) lower bound.
36 Duncan McCallum and David Avis
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
The maximum number of distinct rational power factors in a word of length n is at most (1/8)n² + O(n).
citing papers explorer
-
Computing Planar Convex Hulls with a Promise
Under the promise that the convex hull vertices form a subsequence of the input, the hull can be computed in O(n sqrt(log n)) deterministic time or O(n log^ε n) expected time, and the promise is tight because even one out-of-order hull point forces an Omega(n log n) lower bound.
-
On the Number of Rational Power Factors in a Finite Word
The maximum number of distinct rational power factors in a word of length n is at most (1/8)n² + O(n).