RiffleSort sorts n elements with persistent random comparison errors (p<1/4) in O(n log n) time with O(log n) maximum and O(n) total dislocation, with matching lower bounds.
Hypergeometric tail inequalities: ending the insanity
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
The hypergeometric distribution is briefly and informally surveyed, including popular notation, symmetries, and the tail inequalities $Pr[i \ge E[i]+tn] \le e^{-2t^2n}$ and $Pr[i \le E[i]-tn] \le e^{-2t^2n}$.
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
An Optimal Sorting Algorithm for Persistent Random Comparison Faults
RiffleSort sorts n elements with persistent random comparison errors (p<1/4) in O(n log n) time with O(log n) maximum and O(n) total dislocation, with matching lower bounds.