The I/O complexity of sorting and related problems
- 1 January 1987
- book chapter
- Published by Springer Nature
- p. 467-478
- https://doi.org/10.1007/3-540-18088-5_40
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Tight Bounds on the Complexity of Parallel SortingIEEE Transactions on Computers, 1985
- The Design and Analysis of BucketSort for Bubble Memory Secondary StorageIEEE Transactions on Computers, 1985
- Time bounds for selectionJournal of Computer and System Sciences, 1973
- Permuting Information in Idealized Two-Level StoragePublished by Springer Nature ,1972