@inproceedings{64ccc71fce4c46cebc8feda45e992c0a,
title = "Time and space bounds for selection problems",
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.",
author = "David Dobkin and Munro, {J. Ian}",
note = "Publisher Copyright: {\textcopyright} 1978, Springer-Verlag.; 5th International Colloquium on Automata, Languages and Programming, ICALP 1978 ; Conference date: 17-07-1978 Through 21-07-1978",
year = "1978",
doi = "10.1007/3-540-08860-1_15",
language = "English (US)",
isbn = "9783540088608",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "192--204",
editor = "Corrado Bohm and Giorgio Ausiello",
booktitle = "Automata, Languages and Programming - 5th Colloquium",
address = "Germany",
}