The right tail of the Quickselect cost limit S satisfies -log P(S > t) = t log t + O(t log log t) as t goes to infinity.
Berlin: Springer, 2009, pp
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Distributional Tail of Worst-Case Quickselect
The right tail of the Quickselect cost limit S satisfies -log P(S > t) = t log t + O(t log log t) as t goes to infinity.