L. Arge, M. Knudsen, and K. Larsen, “A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms”, DPB, vol. 21, no. 407, Aug. 1992.