A general lower bound on the I/O-complexity of comparison-based algorithms (1993)

by L Arge, M Knudsen, K Larsen
Venue:In Proceedings of the 3rd Workshop on Algorithms and Data Structures, volume 709 of Lecture Notes in Computer Science