{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T21:51:01Z","timestamp":1672264261296},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8478,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1990,5]]},"DOI":"10.1016\/0166-218x(90)90128-y","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"49-58","source":"Crossref","is-referenced-by-count":18,"title":["Parallel selection"],"prefix":"10.1016","volume":"27","author":[{"given":"Yossi","family":"Azar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas","family":"Pippenger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90128-Y_BIB1","first-page":"188","article-title":"Deterministic selection in O(log log n) parallel time","volume":"18","author":"Ajtai","year":"1986","journal-title":"Proceedings ACM Symposium on Theory of Computing"},{"key":"10.1016\/0166-218X(90)90128-Y_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579338","article-title":"Sorting in c log n steps","volume":"3","author":"Ajtai","year":"1983","journal-title":"Combinatorica"},{"key":"10.1016\/0166-218X(90)90128-Y_BIB3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1137\/0401028","article-title":"Sorting, approximate sorting and searching in rounds","volume":"1","author":"Alon","year":"1988","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0166-218X(90)90128-Y_BIB4","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1137\/0218017","article-title":"Finding an approximate maximum","volume":"18","author":"Alon","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(90)90128-Y_BIB5","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1137\/0216032","article-title":"Tight comparison bounds on the complexity of parallel sorting","volume":"16","author":"Azar","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(90)90128-Y_BIB6","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","article-title":"Time bounds for selection","volume":"7","author":"Blum","year":"1973","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0166-218X(90)90128-Y_BIB7","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1145\/7531.7537","article-title":"Slowing down sorting networks to obtain faster sorting algorithms","volume":"34","author":"Cole","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(90)90128-Y_BIB8","first-page":"497","article-title":"Graphs and parallel comparison algorithms","volume":"29","author":"H\u00e4ggkvist","year":"1980","journal-title":"Congr. Numer."},{"key":"10.1016\/0166-218X(90)90128-Y_BIB9","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1137\/0603047","article-title":"Sorting and merging in rounds","volume":"3","author":"H\u00e4ggkvist","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(90)90128-Y_BIB10","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1109\/TC.1983.1676138","article-title":"Searching, merging and sorting in parallel computation","volume":"32","author":"Kruskal","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(90)90128-Y_BIB11","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","article-title":"Applying parallel computation algorithms in the design of serial algorithms","volume":"30","author":"Megiddo","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(90)90128-Y_BIB12","doi-asserted-by":"crossref","first-page":"1032","DOI":"10.1137\/0216066","article-title":"Sorting and selecting in rounds","volume":"16","author":"Pippenger","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(90)90128-Y_BIB13","doi-asserted-by":"crossref","unstructured":"N. Pippenger, Communication networks, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science (North-Holland, Amsterdam, to appear).","DOI":"10.1016\/B978-0-444-88071-0.50020-5"},{"key":"10.1016\/0166-218X(90)90128-Y_BIB14","doi-asserted-by":"crossref","first-page":"19","DOI":"10.4064\/cm-3-1-19-30","article-title":"On the theory of graphs","volume":"3","author":"Tur\u00e1n","year":"1954","journal-title":"Colloq. Math."},{"key":"10.1016\/0166-218X(90)90128-Y_BIB15","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1137\/0204030","article-title":"Parallelism in comparison problems","volume":"4","author":"Valiant","year":"1975","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090128Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090128Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:56:57Z","timestamp":1555120617000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090128Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["0166218X9090128Y"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90128-y","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,5]]}}}