{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:20:21Z","timestamp":1742617221102,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616269"},{"type":"electronic","value":"9783540706335"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61626-8_30","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:05:32Z","timestamp":1330293932000},"page":"234-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The size complexity of strictly non-blocking fixed ratio concentrators with constant depth"],"prefix":"10.1007","author":[{"given":"H. K.","family":"Dai","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"30_CR1","volume-title":"Mathematical Theory of Connecting Networks and Telephone Traffic","author":"V. E. Bene\u0161","year":"1965","unstructured":"V. E. Bene\u0161. Mathematical Theory of Connecting Networks and Telephone Traffic. Academic Press, New York, 1965."},{"key":"30_CR2","first-page":"64","volume":"9","author":"L. A. Bassalygo","year":"1974","unstructured":"L. A. Bassalygo and M. S. Pinsker. Complexity of an optimum nonblocking switching network without reconnections. Problems of Information Transmission, 9:64\u201366, 1974.","journal-title":"Problems of Information Transmission"},{"key":"30_CR3","first-page":"94","volume":"16","author":"L. A. Bassalygo","year":"1980","unstructured":"L. A. Bassalygo and M. S. Pinsker. Asymptotically optimal networks for generalized rearrangeable switching and generalized switching without rearrangement. Problemy Peredachi Informatsii, 16:94\u201398, 1980.","journal-title":"Problemy Peredachi Informatsii"},{"key":"30_CR4","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1002\/j.1538-7305.1953.tb01433.x","volume":"32","author":"C. Clos","year":"1953","unstructured":"C. Clos. A study of non-blocking switching networks. Bell System Technical Journal, 32:406\u2013424, 1953.","journal-title":"Bell System Technical Journal"},{"key":"30_CR5","unstructured":"H. K. Dai. Complexity issues in strictly non-blocking networks. Ph. D. Dissertation, Department of Computer Science and Engineering, University of Washington. 1991."},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"H. K. Dai. On synchronous strictly non-blocking concentrators and generalized-concentrators. In Proceedings of the 7th International Parallel Processing Symposium, pages 406\u2013412, April 1993.","DOI":"10.1109\/IPPS.1993.262917"},{"key":"30_CR7","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/3-540-58184-7_103","volume-title":"Lecture Notes in Computer Science (817): PARLE'94 Parallel Architectures and Languages Europe","author":"H. K. Dai","year":"1994","unstructured":"H. K. Dai. An improvement in the size-depth tradeoff for strictly non-blocking generalized-concentration networks. In C. Halatsis, D. Maritsas, G. Philokyprou, and S. Theodoridis, editors, Lecture Notes in Computer Science (817): PARLE'94 Parallel Architectures and Languages Europe, pages 214\u2013225, Springer-Verlag, Berlin Heidelberg, 1994."},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"D. Dolev, C. Dwork, N. Pippenger, and A. Wigderson. Superconcentrators, generalizers and generalized connectors with limited depth. In Proceedings of the Fifteenth ACM Symposium on the Theory of Computing, pages 42\u201351. Association for Computing Machinery, May 1983.","DOI":"10.1145\/800061.808731"},{"issue":"2","key":"30_CR9","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1137\/0401018","volume":"1","author":"P. Feldman","year":"1988","unstructured":"P. Feldman, J. Friedman, and N. Pippenger. Wide-sense nonblocking networks. SIAM Journal on Discrete Mathematics, 1(2):158\u2013173, 1988.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"2","key":"30_CR10","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF02122799","volume":"8","author":"J. Friedman","year":"1988","unstructured":"J. Friedman. A lower bound on strictly non-blocking networks. Combinatorica, 8(2):185\u2013188, 1988.","journal-title":"Combinatorica"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/0022-0000(81)90040-4","volume":"22","author":"O. Gabber","year":"1981","unstructured":"O. Gabber and Z. Galil. Explicit construction of linear-sized superconcentrators. Journal of Computer and System Sciences, 22:407\u2013420, 1981.","journal-title":"Journal of Computer and System Sciences"},{"key":"30_CR12","first-page":"325","volume":"9","author":"G. A. Margulis","year":"1975","unstructured":"G. A. Margulis. Explicit constructions of concentrators. Problems of Information Transmission, 9:325\u2013332, 1975.","journal-title":"Problems of Information Transmission"},{"issue":"11","key":"30_CR13","doi-asserted-by":"publisher","first-page":"1890","DOI":"10.1109\/TCOM.1974.1092121","volume":"COM-22","author":"N. Pippenger","year":"1974","unstructured":"N. Pippenger. On the complexity of strictly non-blocking concentration networks. IEEE Transactions on Communications, COM-22(11):1890\u20131892, November 1974.","journal-title":"IEEE Transactions on Communications"}],"container-title":["Lecture Notes in Computer Science","Euro-Par'96 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61626-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:22:49Z","timestamp":1742599369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61626-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616269","9783540706335"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-61626-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}