{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T07:28:53Z","timestamp":1777361333264,"version":"3.51.4"},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1989,5,1]],"date-time":"1989-05-01T00:00:00Z","timestamp":609984000000},"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":8843,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1989,5]]},"DOI":"10.1016\/0012-365x(89)90101-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"381-386","source":"Crossref","is-referenced-by-count":15,"title":["Dense expanders and pseudo-random bipartite graphs"],"prefix":"10.1016","volume":"75","author":[{"given":"Andrew","family":"Thomason","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(89)90101-5_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579338","article-title":"Sorting in C log n parallel steps","volume":"3","author":"Ajtai","year":"1983","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(89)90101-5_BIB2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF02579382","article-title":"Eigenvalues, geometric expanders, sorting in rounds and ramsey theory","volume":"6","author":"Alon","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(89)90101-5_BIB3","series-title":"Geometric Algebra","author":"Artin","year":"1957"},{"key":"10.1016\/0012-365X(89)90101-5_BIB4","series-title":"Graphs and Order","first-page":"169","article-title":"Sorting and graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/0012-365X(89)90101-5_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(83)90095-1","article-title":"Parallel Sorting","volume":"6","author":"Bollob\u00e1s","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(89)90101-5_BIB6","doi-asserted-by":"crossref","first-page":"1765","DOI":"10.1002\/j.1538-7305.1979.tb02972.x","article-title":"On concentrators, superconcentrators, generalizers and non-blocking networks","volume":"58","author":"Chung","year":"1978","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/0012-365X(89)90101-5_BIB7","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/0022-0000(81)90040-4","article-title":"Explicit constructions of linear superconcentrators","volume":"22","author":"Gabber","year":"1981","journal-title":"J. Comp. and Sys. Sci."},{"key":"10.1016\/0012-365X(89)90101-5_BIB8","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1137\/0210034","article-title":"Parallel sorting with constant time for comparisons","volume":"10","author":"H\u00e4ggkvist","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(89)90101-5_BIB9","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0012-365X(89)90093-9","article-title":"Pseudo-random hypergraphs","volume":"75","author":"Haviland","year":"1989","journal-title":"Discrete Math."},{"issue":"4","key":"10.1016\/0012-365X(89)90101-5_BIB10","first-page":"71","article-title":"Explicit constructions of concentrators","volume":"9","author":"Margulis","year":"1973","journal-title":"Problemy Peredachi Informatsii"},{"key":"10.1016\/0012-365X(89)90101-5_BIB11","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1137\/0605030","article-title":"Explicit construction of concentrators from generalized N-gons","volume":"5","author":"Tanner","year":"1985","journal-title":"SIAM J. Alg. Discr. Meth."},{"key":"10.1016\/0012-365X(89)90101-5_BIB12","series-title":"Proceedings of Random Graphs","first-page":"307","article-title":"Pseudo-random graphs","volume":"33","author":"Thomason","year":"1985-1987"},{"key":"10.1016\/0012-365X(89)90101-5_BIB13","first-page":"173","article-title":"Random graphs, strongly regular graphs and pseudo-random graphs","volume":"123","author":"Thomason","year":"1987","journal-title":"LMS Lecture Note Series"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X89901015?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X89901015?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:50:36Z","timestamp":1555134636000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X89901015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["0012365X89901015"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(89)90101-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1989,5]]}}}