{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T21:15:00Z","timestamp":1673039700771},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,2,1]],"date-time":"1983-02-01T00:00:00Z","timestamp":412905600000},"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":11124,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1983,2]]},"DOI":"10.1016\/0304-3975(83)90105-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"233-251","source":"Crossref","is-referenced-by-count":7,"title":["Size bounds for superconcentrators"],"prefix":"10.1016","volume":"22","author":[{"given":"G.","family":"Lev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.G.","family":"Valiant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/0304-3975(83)90105-6_BIB1","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0020-0190(79)90027-9","article-title":"A note on time-space tradeoffs for computing continuous functions","volume":"8","author":"Abelson","year":"1979","journal-title":"Information Processing Lett."},{"key":"10.1016\/0304-3975(83)90105-6_BIB2","series-title":"Mathematical Theory of Connecting Networks and Telephone Traffic","author":"Benes","year":"1965"},{"key":"10.1016\/0304-3975(83)90105-6_BIB3","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0304-3975(83)90105-6_BIB4","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":"1979","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0304-3975(83)90105-6_BIB5","first-page":"1","article-title":"Une propriet\u00e9 des racines de l'unit\u00e9","volume":"25","author":"Dieudonn\u00e9","year":"1970","journal-title":"Rev. Un. Mat. Argentina"},{"key":"10.1016\/0304-3975(83)90105-6_BIB6","first-page":"364","article-title":"Explicit construction of linear size superconcentrators","author":"Gabber","year":"1979","journal-title":"Proc. 20th IEEE Symposium on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(83)90105-6_BIB7","first-page":"339","article-title":"Time-space tradeoffs for some algebraic problems","author":"Ja'Ja'","year":"1980","journal-title":"Proc. 12th ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(83)90105-6_BIB8","series-title":"Ph.D. Thesis","article-title":"Size bounds and parallel algorithms for networks","author":"Lev","year":"1980"},{"key":"10.1016\/0304-3975(83)90105-6_BIB9_1","first-page":"71","article-title":"Explicit construction of concentrators","volume":"9","author":"Margulis","year":"1973","journal-title":"Problemy Pereda\u010di Informacii"},{"key":"10.1016\/0304-3975(83)90105-6_BIB9_2","first-page":"325","article-title":"Explicit construction of concentrators","author":"Margulis","year":"1975","journal-title":"Problems Information Transmission"},{"key":"10.1016\/0304-3975(83)90105-6_BIB10","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1145\/321752.321761","article-title":"Note on a lower bound of the linear complexity of the Fast Fourier Transform","volume":"20","author":"Morgenstern","year":"1973","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(83)90105-6_BIB11","first-page":"318\/1","article-title":"On the complexity of a concentrator","author":"Pinsker","year":"1973","journal-title":"Proc. 7th International Teletraffic Conference"},{"key":"10.1016\/0304-3975(83)90105-6_BIB12","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0206022","article-title":"Superconcentrators","volume":"6","author":"Pippenger","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(83)90105-6_BIB13","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1137\/0207040","article-title":"Generalized connectors","volume":"7","author":"Pippenger","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(83)90105-6_BIB14","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0022-0000(78)90001-6","article-title":"On rearrangeable and non-blocking networks","volume":"17","author":"Pippenger","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(83)90105-6_BIB15","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF02246615","article-title":"Zwei lineare untere Schranken f\u00fcr die Komplexit\u00e4t Boolescher Funktionen","volume":"13","author":"Schnorr","year":"1974","journal-title":"Computing"},{"key":"10.1016\/0304-3975(83)90105-6_BIB16","doi-asserted-by":"crossref","first-page":"1119","DOI":"10.1109\/TC.1978.1675014","article-title":"Generalized connection networks for parallel processor intercommunication","volume":"27","author":"Thompson","year":"1978","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(83)90105-6_BIB17","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/0022-0000(80)90056-2","article-title":"Time space tradeoffs for computing functions using connectivity properties of their circuits","volume":"20","author":"Tompa","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(83)90105-6_BIB18","first-page":"45","article-title":"On non-linear lower bounds in computational complexity","author":"Valiant","year":"1975","journal-title":"Proc. 7th ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(83)90105-6_BIB19","first-page":"162","article-title":"Graph-theoretic arguments in low-level complexity","volume":"53","author":"Valiant","year":"1977"},{"key":"10.1016\/0304-3975(83)90105-6_BIB20","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1145\/321439.321449","article-title":"A permutation network","volume":"15","author":"Waxman","year":"1968","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(83)90105-6_BIB21","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1090\/S0025-5718-1978-0468306-4","article-title":"On computing the discrete Fourier Transform","volume":"32","author":"Winograd","year":"1978","journal-title":"Math. Comput."},{"issue":"2","key":"10.1016\/0304-3975(83)90105-6_BIB22","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0001-8708(79)90037-9","article-title":"On the multiplicative complexity of the Discrete Fourier Transform","volume":"32","author":"Winograd","year":"1979","journal-title":"Adv. in Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583901056?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583901056?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:27:45Z","timestamp":1555126065000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397583901056"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,2]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,2]]}},"alternative-id":["0304397583901056"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90105-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983,2]]}}}