Generalized Selection and Ranking: Sorted Matrices
- 1 February 1984
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 13 (1) , 14-30
- https://doi.org/10.1137/0213002
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Finding kth paths and p-centers by generating and searching good data structuresJournal of Algorithms, 1983
- Polynomially bounded algorithms for locatingp-centers on a treeMathematical Programming, 1982
- The complexity of selection and ranking in X + Y and matrices with sorted columnsJournal of Computer and System Sciences, 1982
- An $O ( ( n\log p )^2 )$ Algorithm for the Continuous p-Center Problem on a TreeSIAM Journal on Algebraic Discrete Methods, 1980
- A Counting Approach to Lower Bounds for Selection ProblemsJournal of the ACM, 1979
- A Fast Selection Algorithm and the Problem of Optimum Distribution of EffortJournal of the ACM, 1979
- On the complexity of computing the measure of ∪[a i ,b i ]Communications of the ACM, 1978
- An almost optimal algorithm for unbounded searchingInformation Processing Letters, 1976
- Time bounds for selectionJournal of Computer and System Sciences, 1973
- Estimates of Location Based on Rank TestsThe Annals of Mathematical Statistics, 1963