Arge, L. A., Knudsen, M. & Larsen, K. (1993).
A general lower bound on the I/O-complexity of comparison-based algorithms. In F. Dehne, J.-R. Sack, N. Santoro & S. Whitesides (Eds.),
Algorithms and Data Structures: Third Workshop, WADS '93 Montréal, Canada, August 11-13, 1993 Proceedings (pp. 83-94). Springer.
https://doi.org/10.1007/3-540-57155-8_238