{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:27:09Z","timestamp":1787340429516,"version":"build-2736575974"},"reference-count":7,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1980,8]]},"abstract":"<jats:p>We investigate the complexity of network selection by measuring it in terms of $U(t,N)$, the minimum number of comparators needed, and $T(t,N)$, the minimum delay time possible, for networks selecting the smallest t elements from a set of N inputs. New bounds on $U(t,N)$ and $T(t,N)$ are presented. In particular, the asymptotic forms of $U(t,N)$ and $T(t,N)$ are determined for any fixed t.<\/jats:p>","DOI":"10.1137\/0209043","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:21:58Z","timestamp":1109226118000},"page":"566-582","source":"Crossref","is-referenced-by-count":20,"title":["Bounds on Selection Networks"],"prefix":"10.1137","volume":"9","author":[{"given":"Andrew Chi-Chih","family":"Yao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"K. E. Batcher,  Sorting networks and their applications,  Proc. AFIPS Spring Joint Computer Conference, Vol. 32, AFIPS Press, Montvale, NJ,  1968,  307\u2013314","DOI":"10.1145\/1468075.1468121"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1137\/0204022"},{"key":"R3","unstructured":"M. W. Green,  Some improvements in non-adaptive sorting algorithms,  Proc. 6th Annual Princeton Conference on Information, Sciences and System,  1972,  387\u2013391"},{"key":"R4","unstructured":"M. W. Green,  Some observations on sorting, Final Report, SRI Project 5509, Stanford Research Institute, Menlo Park, CA,  1970, Cellular Logic in Memory Arrays, Part 1, pp. 49\u201371"},{"key":"R5","volume-title":"The Art of Computer Programming","author":"Knuth D. E.","year":"1973"},{"key":"R6","volume-title":"The Art of Computer Programming, vol. 3","author":"Knuth D. E.","year":"1975"},{"key":"R7","unstructured":"F. F. Yao,  1974, unpublished manuscript"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0209043","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:34:45Z","timestamp":1787337285000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0209043"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,8]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1980,8]]}},"alternative-id":["10.1137\/0209043"],"URL":"https:\/\/doi.org\/10.1137\/0209043","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980,8]]}}}