Time bounds for selection
TLDR
The number of comparisons required to select the i-th smallest of n numbers is shown to be at most a linear function of n by analysis of a new selection algorithm-PICK.About:
This article is published in Journal of Computer and System Sciences.The article was published on 1973-08-01 and is currently open access. It has received 1384 citations till now. The article focuses on the topics: Selection (genetic algorithm) & Upper and lower bounds.read more
Citations
More filters
Journal ArticleDOI
Multidimensional binary search trees used for associative searching
TL;DR: The multidimensional binary search tree (or k-d tree) as a data structure for storage of information to be retrieved by associative searches is developed and it is shown to be quite efficient in its storage requirements.
Book
Introduction to Algorithms, Second Edition
TL;DR: The complexity class P is formally defined as the set of concrete decision problems that are polynomial-time solvable, and encodings are used to map abstract problems to concrete problems.
Book
Algorithms in Combinatorial Geometry
TL;DR: This book offers a modern approach to computational geo- metry, an area thatstudies the computational complexity of geometric problems with an important role in this study.
Journal ArticleDOI
Partitioning sparse matrices with eigenvectors of graphs
TL;DR: In this paper, it is shown that lower bounds on separator sizes can be obtained in terms of the eigenvalues of the Laplacian matrix associated with a graph.
Journal ArticleDOI
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
TL;DR: A self-contained convergence analysis framework is derived and it is established that each bounded sequence generated by PALM globally converges to a critical point.
References
More filters
Book
The Art of Computer Programming
TL;DR: The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Journal ArticleDOI
A Tournament Problem
L. R. Ford,Selmer Martin Johnson +1 more
TL;DR: In this paper, an improved solution is presented for the problem of finding the smallest number of direct pairwise comparisons which will always suffice to rank n objects according to some transitive characteristic.
Book
The Complete Works of Lewis Carroll
TL;DR: In this paper, Lewis Carroll's entire body of work has been published in book form, including all of the poems, essays, phantasmagoria along with a substantial collection of miscellaneous writings.