Arge, Lars, m.fl. “A General Lower Bound on the I O-Complexity of Comparison-Based Algorithms”. DAIMI Report Series, bd. 21, nr. 407, august 1992, doi:10.7146/dpb.v21i407.6641.