An Optimal-Time Algorithm for Slope Selection
- 1 August 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 18 (4) , 792-810
- https://doi.org/10.1137/0218055
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- L-infinity interdistance selection by parametric searchInformation Processing Letters, 1989
- Slowing down sorting networks to obtain faster sorting algorithmsJournal of the ACM, 1987
- Computational GeometryPublished by Springer Nature ,1985
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983
- Sorting inc logn parallel stepsCombinatorica, 1983
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979
- A linear selection algorithm for sets of elements with weightsInformation Processing Letters, 1978
- Time bounds for selectionJournal of Computer and System Sciences, 1973