{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T09:52:17Z","timestamp":1718531537424},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,2,1]],"date-time":"1989-02-01T00:00:00Z","timestamp":602294400000},"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":8932,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1989,2]]},"DOI":"10.1016\/0022-0000(89)90035-4","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"125-133","source":"Crossref","is-referenced-by-count":21,"title":["Optimal parallel selection has complexity O(Log Log N)"],"prefix":"10.1016","volume":"38","author":[{"given":"Mikl\u00f3s","family":"Ajtai","sequence":"first","affiliation":[]},{"given":"J\u00e1nos","family":"Koml\u00f3s","sequence":"additional","affiliation":[]},{"given":"W.L.","family":"Steiger","sequence":"additional","affiliation":[]},{"given":"Endre","family":"Szemer\u00e9di","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(89)90035-4_BIB1","series-title":"Proceedings, 15th ACM Symp. on Theory of Computing","first-page":"1","article-title":"An O(n log n) sorting network","author":"Ajtai","year":"1983"},{"key":"10.1016\/0022-0000(89)90035-4_BIB2","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\/0022-0000(89)90035-4_BIB3","series-title":"Proceedings, 14th Symp. on Theory of Computing","first-page":"338","article-title":"Routing, merging, and sorting on parallel models of computation","author":"Borodin","year":"1982"},{"key":"10.1016\/0022-0000(89)90035-4_BIB4","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0020-0190(85)90080-8","article-title":"A parallel median algorithm","volume":"20","author":"Cole","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(89)90035-4_BIB5","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/0022-0000(81)90040-4","article-title":"Explicit construction of linear sized superconcentrators","volume":"22","author":"Gabber","year":"1981","journal-title":"J. Compui. System Sci."},{"key":"10.1016\/0022-0000(89)90035-4_BIB6","series-title":"A lower bound of \u03c9(log log n) for randomized parallel merging (draft)","author":"Ger\u00e9b-Graus","year":"1985"},{"key":"10.1016\/0022-0000(89)90035-4_BIB7","series-title":"Proceedings, 18th ACM Symp. on Theory of Computing","first-page":"240","article-title":"Explicit expanders and the Ramanujan conjecture","author":"Lubotzky","year":"1986"},{"key":"10.1016\/0022-0000(89)90035-4_BIB8","first-page":"71","article-title":"Explicit construction of concentrators","volume":"9","author":"Margulis","year":"1973","journal-title":"Problemy Peredachi Informatsii"},{"key":"10.1016\/0022-0000(89)90035-4_BIB9","series-title":"Proceedings, 22nd Found. of Comput. Sci","first-page":"212","article-title":"A fast probabilistic sorting algorithm","author":"Reischuk","year":"1981"},{"key":"10.1016\/0022-0000(89)90035-4_BIB10","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":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900354?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900354?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:54:38Z","timestamp":1550325278000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000089900354"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,2]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,2]]}},"alternative-id":["0022000089900354"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(89)90035-4","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1989,2]]}}}