The Complexity of Selection and Ranking in X+Y and Matrices with Sorted Columns

@article{Frederickson1982TheCO,
  title={The Complexity of Selection and Ranking in X+Y and Matrices with Sorted Columns},
  author={Greg N. Frederickson and Donald B. Johnson},
  journal={J. Comput. Syst. Sci.},
  year={1982},
  volume={24},
  pages={197-208}
}
The complexity of selection is analyzed for two sets, X+ Y and matrices with sorted columns. Algorithms are presented that run in time which depends nontrivially on the rank k of the element to be selected and which is sublinear with respect to set cardinality. Identical bounds are also shown for the problem of ranking elements in these sets, and all bounds are shown to be optimal to within a constant multiplicative factor. 
Highly Influential
This paper has highly influenced 27 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 99 extracted citations

A Decomposition Algorithm for Nested Resource Allocation Problems

SIAM Journal on Optimization • 2016
View 4 Excerpts
Highly Influenced

Efficient Algorithms for the Maximum Convex Sum Problem

Mohammed Thaher, S. Brown, Co-Supervisor
2014
View 5 Excerpts
Highly Influenced

On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures

Symposium on Computational Geometry • 2014
View 4 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-8 of 8 references

MEGIDDO, A fast selection algorithm and the problem of optimum distribution of effort

N. Z. GALIL
J. Assoc. Comput. Mach • 1979
View 1 Excerpt

KASHDAN, Lower bounds for selection in X + Y and other multisets

S.D.D.B. JOHNSON
J. Assoc. Comput. Mach • 1978

J . L . BENTLEY AND A . C . YAO , An almost optimal algorithm for unbounded searching , Inform . Process

V. R. PRAY, R. L. RIVEST, AND R. E. TARIAN
. Lett . • 1976

RABIN, Proving simultaneous positivity of linear forms

J. Comput. System. Sci • 1972
View 2 Excerpts

TARIAN, Time bounds for selection

M. BLUM, R. W. FLOYD, V. R. PRAY, R. L. RIVEST, E R.
J. Comput. System. Sci • 1972
View 1 Excerpt

Discrete optimization via marginal analysis

B. L. Fox
Management Sci • 1966

Similar Papers

Loading similar papers…