1. A. Aggarwal and M.-D. Huang. Network complexity of sorting and graph problems and simulating CRCW PRAMS by interconnection networks. InVLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, AWOC 88, pp. 339–350. Lecture Notes in Computer Science, Vol. 319, Springer-Verlag, Berlin, 1988.
2. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems.Communications of the ACM, 31:1116–1127, September 1988.
3. M. J. Atallah, G. N. Frederickson, and S. R. Kosaraju. Sorting with efficient use of special-purpose sorters.Information Processing Letters, 27:13–15, 1988.
4. R. Beigel and J. Gill. Sortingn objects with ak-sorter.IEEE Transactions on Computers, 1990.
5. J. Bentley. Algorithms for Klee's rectangle problems. Unpublished notes, Computer Science Department, Carnegie-Mellon University, 1977.