A general lower bound on the I/O-complexity of comparison-based algorithms
- 1 January 1993
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Sorting multisets and vectors in-placePublished by Springer Science and Business Media LLC ,2005
- Efficient memory access in large-scale computationPublished by Springer Science and Business Media LLC ,2005
- Optimal disk I/O with parallel block transferPublished by Association for Computing Machinery (ACM) ,1990
- Lower bounds for algebraic computation treesPublished by Association for Computing Machinery (ACM) ,1983
- Sorting and Searching in MultisetsSIAM Journal on Computing, 1976
- Time bounds for selectionJournal of Computer and System Sciences, 1973