{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T01:40:03Z","timestamp":1648863603722},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1989,6]]},"DOI":"10.1007\/bf01553891","type":"journal-article","created":{"date-parts":[[2005,4,20]],"date-time":"2005-04-20T22:07:35Z","timestamp":1114034855000},"page":"293-300","source":"Crossref","is-referenced-by-count":5,"title":["On selecting thek largest with median tests"],"prefix":"10.1007","volume":"4","author":[{"given":"Andrew","family":"Chi-Chih Yao","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01553891_CR1","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, Lower bounds for algebraic computation trees,Proceedings of the 15th ACM Symposium on Theory of Computing, 1983, pp. 80\u201386.","DOI":"10.1145\/800061.808735"},{"key":"BF01553891_CR2","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/0022-0000(78)90026-0","volume":"16","author":"D. Dobkin","year":"1978","unstructured":"D. Dobkin and R. J. Lipton, A lower bound of 1\/2n2 on linear search tree programs for the knapsack problems,J. Comput. System Sci.,16 (1978), 413\u2013417.","journal-title":"J. Comput. System Sci."},{"key":"BF01553891_CR3","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1145\/322123.322128","volume":"26","author":"F. Fussenegger","year":"1979","unstructured":"F. Fussenegger and H. N. Gabow, Using comparison trees to derive lower bounds for selection problems,J. Assoc. Comput. Mach.,26 (1979), 227\u2013238.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01553891_CR4","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/0205010","volume":"5","author":"L. Hyafil","year":"1976","unstructured":"L. Hyafil, Bounds for selection,SIAM J. Comput.,5 (1976), 109\u2013114.","journal-title":"SIAM J. Comput."},{"key":"BF01553891_CR5","unstructured":"D. G. Kirkpatrick, Topics in the complexity of combinatorial algorithms, Report TR 74, Computer Science Department, University of Toronto, 1974."},{"key":"BF01553891_CR6","first-page":"557","volume":"5","author":"S. S. Kislytsyn","year":"1964","unstructured":"S. S. Kislytsyn, On the selection of thek-th element of an ordered set by pairwise comparisons,Sibirsk Mat. Zh.,5 (1964), 557\u2013564.","journal-title":"Sibirsk Mat. Zh."},{"key":"BF01553891_CR7","volume-title":"The Art of Computer Programming, Vol. 3","author":"D. E. Knuth","year":"1973","unstructured":"D. E. Knuth,The Art of Computer Programming, Vol. 3, Addison-Wesley, Reading, MA, 1973."},{"key":"BF01553891_CR8","doi-asserted-by":"crossref","unstructured":"V. R. Pratt and F. F. Yao, On lower bounds for computing thei-th largest element,Proceedings of the 14th IEEE Symposium on Switching and Automata Theory, 1973, pp. 70\u201381.","DOI":"10.1109\/SWAT.1973.18"},{"key":"BF01553891_CR9","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1016\/S0022-0000(72)80034-5","volume":"6","author":"M. Rabin","year":"1972","unstructured":"M. Rabin, Proving simultaneous positivity of linear forms,J. Comput. System Sci.,6 (1972), 639\u2013350.","journal-title":"J. Comput. System Sci."},{"key":"BF01553891_CR10","doi-asserted-by":"crossref","unstructured":"E. M. Reingold, Computing the maxima and the median,Proceedings of the 12th IEEE Symposium on Switching and Automata Theory, 1971, pp. 216\u2013218.","DOI":"10.1109\/SWAT.1971.9"},{"key":"BF01553891_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0196-6774(82)90002-5","volume":"3","author":"J. M. Steele","year":"1982","unstructured":"J. M. Steele and A. C. Yao, Lower bounds for algebraic decision trees,J. Algorithms,3 (1982), 1\u20138.","journal-title":"J. Algorithms"},{"key":"BF01553891_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-46216-0","volume-title":"Convexity and Optimization in Finite Dimensions I","author":"J. Stoer","year":"1970","unstructured":"J. Stoer and C. Witzgall,Convexity and Optimization in Finite Dimensions I, Springer-Verlag, Berlin, 1970."},{"key":"BF01553891_CR13","doi-asserted-by":"crossref","unstructured":"A. C. Yao, On the complexity of comparison problems using linear functions,Proceedings of the 16th Annual IEEE Symposium on Foundations of Computer Sciences, 1975, pp. 85\u201389.","DOI":"10.1109\/SFCS.1975.20"},{"key":"BF01553891_CR14","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1145\/322276.322289","volume":"28","author":"A. C. Yao","year":"1981","unstructured":"A. C. Yao, A lower bound to finding convex hulls,J Assoc. Comput. Mach.,28 (1981), 780\u2013787.","journal-title":"J Assoc. Comput. Mach."},{"key":"BF01553891_CR15","unstructured":"F. F. Yao, On lower bounds for selection problems, Ph.D. thesis, Massachusetts Institute of Technology, 1973."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01553891.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01553891\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01553891","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T01:16:45Z","timestamp":1586222205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01553891"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":15,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["BF01553891"],"URL":"https:\/\/doi.org\/10.1007\/bf01553891","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}