Arge, Lars, Mikael Knudsen, og Kirsten Larsen. “A General Lower Bound on the I O-Complexity of Comparison-Based Algorithms”. DAIMI Report Series 21, no. 407 (august 1, 1992). Set november 19, 2026. https://tidsskrift.dk/daimipb/article/view/6641.