Using computer trees to derive lower bounds for selection problems
- 1 October 1976
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02725428,p. 178-182
- https://doi.org/10.1109/sfcs.1976.34
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Bounds for SelectionSIAM Journal on Computing, 1976
- On the complexity of comparison problems using linear functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975
- On lower bounds for computing the i-th largest elementPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1973
- A sorting problem and its complexityCommunications of the ACM, 1972
- Computing the maximum and the medianPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1971