Time and space bounds for selection problems
- 1 January 1978
- book chapter
- Published by Springer Nature
- p. 192-204
- https://doi.org/10.1007/3-540-08860-1_15
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Sorting and Searching in MultisetsSIAM Journal on Computing, 1976
- On lower bounds for computing the i-th largest elementPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1973
- A Simple Algorithm for Merging Two Disjoint Linearly Ordered SetsSIAM Journal on Computing, 1972