Breaking the Θ(n log 2 n) barrier for sorting with faults (1997)

by T Leighton, Y Ma, C G Plaxton
Venue:Journal of Computer and System Sciences