{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:38Z","timestamp":1759063838174},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1007\/bf01300126","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T06:09:49Z","timestamp":1111730989000},"page":"41-58","source":"Crossref","is-referenced-by-count":12,"title":["Finding the ?n-th largest element"],"prefix":"10.1007","volume":"16","author":[{"given":"Dorit","family":"Dor","sequence":"first","affiliation":[]},{"given":"Uri","family":"Zwick","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M. Blum","year":"1973","unstructured":"M. Blum, R.W. Floyd, V. Pratt, R.L. Rivest, andR.E. Tarjan: Time bounds for selection,Journal of Computer and System Sciences,7 (1973), 448?461.","journal-title":"Journal of Computer and System Sciences"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"S.W. Bent andJ.W. John: Finding the median requires 2n comparisons, InProceedings of the 17th Annual ACM Symposium on Theory of Computing, Providence, Rhode Island, 1985, 213?216.","DOI":"10.1145\/22145.22169"},{"key":"CR3","series-title":"St. James's Gazette","first-page":"5","volume-title":"Lawn tennis tournaments","author":"L. Carroll","year":"1883","unstructured":"L. Carroll: Lawn tennis tournaments,St. James's Gazette, pages 5?6, August 1883, Reprinited in ?The complete stories of Lewis Carrol?, Magpie Books Ltd., London, 1993, 775?782."},{"issue":"2","key":"CR4","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1145\/62044.62047","volume":"36","author":"W. Cunto","year":"1989","unstructured":"W. Cunto andJ.I. Munro: Average case selection,Journal of the ACM,36 (2) (1989), 270?279.","journal-title":"Journal of the ACM"},{"key":"CR5","unstructured":"D. Dor andU. Zwick: Selecting the median, InProceedings of the 6rd Annual ACM-SIAM Symposium on Discrete Algorithms, 1995, 28?37."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1145\/360680.360691","volume":"18","author":"R.W. Floyd","year":"1975","unstructured":"R.W. Floyd andR.L. Rivest: Expected time bounds for selection,Communication of the ACM,18 (1975), 165?173.","journal-title":"Communication of the ACM"},{"key":"CR7","first-page":"585","volume":"4","author":"A. Hadian","year":"1969","unstructured":"A. Hadian andM. Sobel: Selecting thet-th largest using binary errorless comparisons,Colloquia Mathematica Societatis J\ufffdnos Bolyai,4 (1969), 585?599.","journal-title":"Colloquia Mathematica Societatis J\ufffdnos Bolyai"},{"issue":"4","key":"CR8","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1137\/0217040","volume":"17","author":"J.W. John","year":"1988","unstructured":"J.W. John: A new lower bound for the set-partition problem,SIAM Journal on Computing,17 (4) (1988), 640?647.","journal-title":"SIAM Journal on Computing"},{"key":"CR9","first-page":"557","volume":"5","author":"S.S. Kislitsyn","year":"1964","unstructured":"S.S. Kislitsyn: On the selection of thek-th element of an ordered set by pairwise comparisons,Sibirsk. Mat. Zh.,5 (1964), 557?564.","journal-title":"Sibirsk. Mat. Zh."},{"key":"CR10","unstructured":"Donald E. Knuth:Sorting and searching, Volume 3 ofThe art of computer programming, Addison-Wesley, 1973."},{"issue":"5","key":"CR11","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/0020-0190(82)90120-X","volume":"15","author":"T. Motoki","year":"1982","unstructured":"T. Motoki: A note on upper bounds for selection problems,Information Processing Letters,15 (5) (1982), 214?219.","journal-title":"Information Processing Letters"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1016\/0196-6774(84)90008-7","volume":"5","author":"P.V. Ramanan","year":"1984","unstructured":"P.V. Ramanan andL. Hyafil: New algorithms for selection,Journal of Algorithms,5 (1984), 557?578.","journal-title":"Journal of Algorithms"},{"key":"CR13","first-page":"154","volume":"7","author":"J. Schreier","year":"1932","unstructured":"J. Schreier: On tournament elimination systems,Mathesis Polska,7 (1932), 154?160. (in Polish).","journal-title":"Mathesis Polska"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/S0022-0000(76)80029-3","volume":"13","author":"A. Sch\ufffdnhage","year":"1976","unstructured":"A. Sch\ufffdnhage, M. Paterson, andN. Pippenger: Finding the median,Journal of Computer and System Sciences,13 (1976), 184?199.","journal-title":"Journal of Computer and System Sciences"},{"key":"CR15","unstructured":"F. Yao: On lower bounds for selection problems, Technical Report MAC TR-121, Mass. Inst. of Technology, 1974."},{"issue":"9","key":"CR16","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/360336.360339","volume":"19","author":"C.K. Yap","year":"1976","unstructured":"C.K. Yap: New upper bounds for selection,Communication of the ACM,19 (9) (1976), 501?508.","journal-title":"Communication of the ACM"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01300126.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01300126\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01300126","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T13:52:47Z","timestamp":1586181167000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01300126"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["BF01300126"],"URL":"https:\/\/doi.org\/10.1007\/bf01300126","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}