L-infinity interdistance selection by parametric search
- 16 January 1989
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 30 (1) , 9-14
- https://doi.org/10.1016/0020-0190(89)90166-x
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Slowing down sorting networks to obtain faster sorting algorithmsJournal of the ACM, 1987
- New Data Structures for Orthogonal Range QueriesSIAM Journal on Computing, 1985
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983
- The complexity of selection and ranking in X + Y and matrices with sorted columnsJournal of Computer and System Sciences, 1982
- Combinatorial Optimization with Rational Objective FunctionsMathematics of Operations Research, 1979
- A Fast Selection Algorithm and the Problem of Optimum Distribution of EffortJournal of the ACM, 1979
- Parallelism in Comparison ProblemsSIAM Journal on Computing, 1975
- Time bounds for selectionJournal of Computer and System Sciences, 1973