A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31:1116-1127, 1988. [OpenAIRE]
 G. S. Brodal. Worst-case efficient priority queues. In Proc. 7th ACM/SIAM Symposium on Discrete Algorithms, SODA '96, pages 52-58, 1996. [OpenAIRE]
 G. S. Brodal and R. Fagerberg. Lower bounds for external memory dictionaries. In Proc. 14th ACM/SIAM Symposium on Discrete Algorithms, SODA '03, pages 546-554, 2003. [OpenAIRE]
 J. Brody, A. Chakrabarti, R. Kondapally, D. P. Woodruff, and G. Yaroslavtsev. Beyond set disjointness: The communication complexity of finding the intersection. In Proc. 2014 ACM Symposium on Principles of Distributed Computing, PODC '14, pages 106-113, 2014.
 T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press, Cambridge, Mass., 1990.
 R. Fadel, K. V. Jakobsen, J. Katajainen, and J. Teuhola. Heaps and heapsort on secondary storage. Theoretical Computer Science, 220(2):345-362, June 1999. [OpenAIRE]
 M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34(3):596-615, July 1987.
 Y. Han. Deterministic sorting in o(nlog log n) time and linear space. In Proc. 34th ACM Symposium on Theory of Computation, STOC '02, pages 602-608, 2002.
 Y. Han and M. Thorup. Integer sorting in O(n√lg lg n) expected time and linear space. In Proc. 43rd IEEE Symposium on Foundations of Computer Science, pages 135-144, 2002. [OpenAIRE]
 J. Iacono and M. Paˇtra¸scu. Using hashing to solve the dictionary problem (in external memory). In Proc. 23rd ACM/SIAM Symposium on Discrete Algorithms, pages 570-582, 2012.
 V. Kumar and E. J. Schwabe. Improved algorithms and data structures for solving graph problems in external memory. In Proc. 8th IEEE Symposium on Parallel and Distributed Processing, SPDP '96, pages 169-, 1996.
 U. Meyer and N. Zeh. I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths, pages 540-551. 2006. [OpenAIRE]
 P. Miltersen, N. Nisan, S. Safra, and A. Wigderson. On data structures and asymmetric communication complexity. Journal of Computer and System Sciences, 57(1):37-49, 1998. [OpenAIRE]
 M. Thorup. Integer priority queues with decrease key in constant time and the single source shortest paths problem. Journal of Computer and System Sciences, 69(3):330-353, 2004. [OpenAIRE]
 M. Thorup. Equivalence between priority queues and sorting. Journal of the ACM, 54(6), Dec. 2007.