A general lower bound on the I/O-complexity of comparison-based algorithms
Authors:
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 83-94
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Optimal disk I/O with parallel block transfer1990
- Lower bounds for algebraic computation trees1983
- Sorting and Searching in MultisetsSIAM Journal on Computing, 1976
- Time bounds for selectionJournal of Computer and System Sciences, 1973