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.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 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.