[1]
L. Arge, M. Knudsen, og K. Larsen, “A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms”, DPB, bd. 21, nr. 407, aug. 1992.