{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,22]],"date-time":"2022-12-22T17:49:32Z","timestamp":1671731372799},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1016\/0020-0190(96)00104-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:21:21Z","timestamp":1027621281000},"page":"123-127","source":"Crossref","is-referenced-by-count":3,"title":["Matching nuts and bolts faster"],"prefix":"10.1016","volume":"59","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Phillip G.","family":"Bradford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rudolf","family":"Fleischer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00104-4_BIB1","series-title":"Proc. 15th ACM Symp. on the Theory of Computing (STOC'83)","first-page":"1","article-title":"An O(n log n) sorting network","author":"Ajtai","year":"1983"},{"key":"10.1016\/0020-0190(96)00104-4_BIB2","series-title":"Proc. 5th Ann. ACMSIAM Symp. on Discrete Algorithms (SODA'94)","first-page":"690","article-title":"Matching nuts and bolts","author":"Alon","year":"1994"},{"key":"10.1016\/0020-0190(96)00104-4_BIB3","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0196-6774(87)90014-9","article-title":"Better expanders and superconcentrators","volume":"8","author":"Alon","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(96)00104-4_BIB4","series-title":"The Probabilistic Method","author":"Alon","year":"1992"},{"key":"10.1016\/0020-0190(96)00104-4_BIB5","series-title":"Proc. 6th Internat. Symp. on Algorithms and Computation (ISAAC'95)","first-page":"402","article-title":"Matching nuts and bolts faster","author":"Bradford","year":"1995"},{"key":"10.1016\/0020-0190(96)00104-4_BIB6","article-title":"Matching nuts and bolts optimally","author":"Bradford","year":"1995"},{"key":"10.1016\/0020-0190(96)00104-4_BIB7","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/0020-0190(96)00104-4_BIB8","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1137\/0222020","article-title":"Optimal randomized algorithms for local sorting and set-maxima","volume":"22","author":"Goddard","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(96)00104-4_BIB9","series-title":"Proc. 7th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'96)","first-page":"232","article-title":"Matching nuts and bolts in O(n log n) time","author":"Koml\u00f3s","year":"1996"},{"key":"10.1016\/0020-0190(96)00104-4_BIB10","series-title":"Discrete Groups, Expanding Graphs and Invariant Measures","author":"Lubotzky","year":"1994"},{"key":"10.1016\/0020-0190(96)00104-4_BIB11","series-title":"Proc. 18th ACM Symp. on the Theory of Computing (STOC'86)","first-page":"240","article-title":"Explicit expanders and the Ramanujan conjectures","author":"Lubotzky","year":"1986"},{"key":"10.1016\/0020-0190(96)00104-4_BIB12","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02126799","article-title":"Ramanujan graphs","volume":"8","author":"Lubotzky","year":"1988","journal-title":"Combinatorica"},{"key":"10.1016\/0020-0190(96)00104-4_BIB13_1","first-page":"51","article-title":"Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and superconcentrators","volume":"24","author":"Margulis","year":"1988","journal-title":"Problemy Peredachi Informatsii"},{"key":"10.1016\/0020-0190(96)00104-4_BIB13_2","first-page":"39","volume":"24","author":"Margulis","year":"1988","journal-title":"Problems of Information Transmission"},{"key":"10.1016\/0020-0190(96)00104-4_BIB14","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0304-3975(80)90061-4","article-title":"Selection and sorting with limited storage","volume":"12","author":"Munro","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(96)00104-4_BIB15","series-title":"Compared to What? An Introduction to the Analysis of Algorithms","author":"Rawlins","year":"1992"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096001044?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096001044?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:24:18Z","timestamp":1556058258000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096001044"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["0020019096001044"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00104-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}