Abstract
The complexity of a number of selection problems is considered. An algorithm is given to determine the mode of a multiset in a number of comparisons differing from the lower bound by only a "lower order term." The problems of finding the kth largest element in a set in minimal and near minimal space are also discussed. A time space tradeoff is demonstrated for these problems.
Cite
CITATION STYLE
Dobkin, D., & Munro, J. I. (1978). Time and space bounds for selection problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 62 LNCS, pp. 192–204). Springer Verlag. https://doi.org/10.1007/3-540-08860-1_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
