The I/O complexity of sorting and related problems: extended abstract

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 267 LNCS, Issue , 1987, Pages 467-478

  Aggarwal, Alok ^a   Vitter, Jeffrey Scott ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; FAST FOURIER TRANSFORMS; MAGNETIC STORAGE;

CONSTANT FACTORS; EXTENDED ABSTRACTS; INTERNAL MEMORY; OPTIMAL ALGORITHM; PERMUTATION NETWORK; SECONDARY STORAGE; SORTING ALGORITHM; UPPER AND LOWER BOUNDS;

MAGNETIC DISK STORAGE;

EID: 85029487505     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-18088-5_40     Document Type: Conference Paper

References (9)

1. R. Beigel and J. Gill. Personal communication (1986).
2. M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan. “Time Bounds for Selection,” Journal of Computer and System Sciences, 7 (1973), 448–461.
3. R. W. Floyd. “Permuting Information in Idealized Two-Level Storage,” Complexity of Computer Calculations, Plenum, New York (1972), 105–109.
4. Hong J. W. and H. T. Kung. “I/O Complexity: The Red-Blue Pebble Game,” Proceedings of the 13th Annual ACM Symposium on Theory of Computing, Milwaukee, WI (October 1981), 326–333.
5. D. E. Knuth. The Art of Computer Programming. Volume 3: Sorting and Searching. Addison-Wesley, Reading, MA (1973).
6. F. T. Leighton. “Tight Bounds on the Complexity of Parallel Sorting,” IEEE Transactions on Computers, C-34(4), Special Issue on Sorting (April 1985).
7. E. E. Lindstrom and J. S. Vitter. “The Design and Analysis of BucketSort for Bubble Memory Secondary Storage,” IEEE Transactions on Computers, C-34(3) (March 1985), 218–233.
8. J. E. Savage and J. S. Vitter. “Parallelism in Space-Time Tradeoffs,” Advances in Computing Research, Volume 4: Special Issue on Parallel and Distributed Computing, JAI Press, Greenwich, CT (1987), 117–146.
9. C. L. Wu and T. Y. Feng. “The Universality of the Shuffle-Exchange Network,” IEEE Transactions on Computers, C-30(5) (May 1981), 324–332.