{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:57Z","timestamp":1742617197948,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540581840"},{"type":"electronic","value":"9783540484776"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58184-7_103","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:27:50Z","timestamp":1330270070000},"page":"214-225","source":"Crossref","is-referenced-by-count":2,"title":["An improvement in the size-depth tradeoff for strictly non-blocking generalized-concentration networks"],"prefix":"10.1007","author":[{"given":"H. K.","family":"Dai","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"19_CR1","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":"19_CR2","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":"19_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J. A. Bondy","year":"1976","unstructured":"J. A. Bondy and U. S. R. Murty. Graph Theory with Applications. Macmillan, London, 1976."},{"key":"19_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":"19_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":"19_CR6","doi-asserted-by":"crossref","unstructured":"H. K. Dai. On synchronous strictly non-blocking concentrators and generalizedconcentrators. In Proceedings of the 7th International Parallel Processing Symposium, pages 406\u2013412, April 1993.","DOI":"10.1109\/IPPS.1993.262917"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"H. K. Dai. Size-depth tradeoff for synchronous strictly non-blocking generalizedconcentrators. In Proceedings of the 5th International Conference on Computing and Information, pages 41\u201347, May 1993.","DOI":"10.1109\/ICCI.1993.315348"},{"key":"19_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"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"P. Feldman, J. Friedman, and N. Pippenger. Non-blocking networks. In Proceedings of the Eighteenth ACM Symposium on the Theory of Computing, pages 247\u2013254. Association for Computing Machinery, May 1986.","DOI":"10.1145\/12130.12155"},{"issue":"2","key":"19_CR10","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":"19_CR11","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"},{"issue":"11","key":"19_CR12","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","PARLE'94 Parallel Architectures and Languages Europe"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58184-7_103.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:22:07Z","timestamp":1742595727000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58184-7_103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540581840","9783540484776"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-58184-7_103","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}