{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T14:50:47Z","timestamp":1761663047880},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540580782"},{"type":"electronic","value":"9783540484356"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58078-6_1","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:10:22Z","timestamp":1330269022000},"page":"1-12","source":"Crossref","is-referenced-by-count":2,"title":["Juggling networks"],"prefix":"10.1007","author":[{"given":"Nicholas","family":"Pippenger","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579338","volume":"3","author":"M. Ajtai","year":"1983","unstructured":"M. Ajtai, J. Koml\u00f3s and E. Szemer\u00e9di: Sorting in c log n parallel steps. Combinatorica 3 (1983) 1\u201319","journal-title":"Combinatorica"},{"key":"1_CR2","first-page":"1","volume":"15","author":"M. Ajtai","year":"1983","unstructured":"M. Ajtai, J. Koml\u00f3s and E. Szemerdi: An O(n log n) sorting network. Proc. ACM Symp. on Theory of Computing 15 (1983) 1\u20139","journal-title":"Proc. ACM Symp. on Theory of Computing"},{"key":"1_CR3","first-page":"149","volume":"22","author":"S. Arora","year":"1990","unstructured":"S. Arora, T. Leighton and B. Maggs: On-line algorithms for path selection in a nonblocking network. Proc. ACM Symp. on Theory of Computing 22 (1990) 149\u2013158","journal-title":"Proc. ACM Symp. on Theory of Computing"},{"key":"1_CR4","first-page":"64","volume":"9","author":"L. A. Bassalygo","year":"1974","unstructured":"L. A. Bassalygo and M. S. Pinsker: Complexity of an optimal nonblocking switching network without reconnections. Problems of Inform. Transm. 9 (1974) 64\u201366","journal-title":"Problems of Inform. Transm."},{"key":"1_CR5","first-page":"307","volume":"32","author":"K. E. Batcher","year":"1968","unstructured":"K. E. Batcher: Sorting networks and their applications. Proc. AFIPS Spring Joint Computer Conf. 32 (1968) 307\u2013314","journal-title":"Proc. AFIPS Spring Joint Computer Conf."},{"key":"1_CR6","doi-asserted-by":"crossref","first-page":"1641","DOI":"10.1002\/j.1538-7305.1964.tb04103.x","volume":"43","author":"V. E. Bene\u0161","year":"1964","unstructured":"V. E. Bene\u0161: Optimal rearrangeable multistage connecting networks. Bell Sys. Tech. J. 43 (1964) 1641\u20131656","journal-title":"Bell Sys. Tech. J."},{"key":"1_CR7","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1002\/net.3230010406","volume":"1","author":"D. G. Cantor","year":"1971","unstructured":"D. G. Cantor: On non-blocking switching networks. Networks 1 (1971) 367\u2013377","journal-title":"Networks"},{"key":"1_CR8","doi-asserted-by":"crossref","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 constructions of linear-sized superconcentrators. J. Comp. and System Science 22 (1981) 407\u2013420","journal-title":"J. Comp. and System Science"},{"key":"1_CR9","first-page":"935","volume":"44","author":"H. Inose","year":"1961","unstructured":"H. Inose: Blocking probability in 3-stage time division switching network. J. IECEJ 44 (1961) 935\u2013941","journal-title":"J. IECEJ"},{"key":"1_CR10","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF02579322","volume":"7","author":"S. Jimbo","year":"1987","unstructured":"S. Jimbo and A. Maruoka: Expanders obtained from affine transformations. Combinatorica 7 (1987) 343\u2013355","journal-title":"Combinatorica"},{"key":"1_CR11","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1109\/TC.1978.1675164","volume":"27","author":"J. Lenfant","year":"1978","unstructured":"J. Lenfant: Parallel Permutations of Data: A Bene\u0161 network control algorithm for frequently used permutations. IEEE Trans. on Computers 27 (1978) 637\u2013647","journal-title":"IEEE Trans. on Computers"},{"key":"1_CR12","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"A. Lubotzky, R. Phillips and P. Sarnak: Ramanujan graphs. Combinatorica 8 (1988) 261\u2013277","journal-title":"Combinatorica"},{"key":"1_CR13","first-page":"812","volume":"26","author":"M. J. Marcus","year":"1970","unstructured":"M. J. Marcus: Designs for time slot interchangers. Proc. National Electronics Conf. 26 (1970) 812\u2013817","journal-title":"Proc. National Electronics Conf."},{"key":"1_CR14","first-page":"71","volume":"9","author":"G. A. Margulis","year":"1974","unstructured":"G. A. Margulis: Explicit construction of concentrators. Problems of Inform. Transm. 9 (1974) 71\u201380","journal-title":"Problems of Inform. Transm."},{"key":"1_CR15","first-page":"39","volume":"24","author":"G. A. Margulis","year":"1988","unstructured":"G. A. Margulis: Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators. Problems of Inform. Transm. 24 (1988) 39\u201346","journal-title":"Problems of Inform. Transm."},{"key":"1_CR16","first-page":"318\/1","volume":"7","author":"M. S. Pinsker","year":"1973","unstructured":"M. S. Pinsker: On the complexity of a concentrator. Proc. Internat. Teletraffic Congr. 7 (1973) 318\/1\u20134","journal-title":"Proc. Internat. Teletraffic Congr."},{"key":"1_CR17","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1090\/psapm\/026\/9888","volume":"26","author":"N. Pippenger","year":"1982","unstructured":"N. Pippenger: Telephone switching networks. Proc. AMS Symp. Appl. Math. 26 (1982) 101\u2013133","journal-title":"Proc. AMS Symp. Appl. Math."},{"key":"1_CR18","volume-title":"Handbook of Theoretical Computer Science \u2014 Volume A: Algorithms and Complexity","author":"N. Pippenger","year":"1990","unstructured":"N. Pippenger: Communication networks. In J. van Leeuwen (ed.), Handbook of Theoretical Computer Science \u2014 Volume A: Algorithms and Complexity, Elsevier, Amsterdam, 1990."},{"key":"1_CR19","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1002\/rsa.3240020202","volume":"2","author":"N. Pippenger","year":"1991","unstructured":"N. Pippenger: The blocking probability of spider-web networks. Random Structures and Algorithms 2 (1991) 121\u2013149","journal-title":"Random Structures and Algorithms"},{"key":"1_CR20","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/0166-218X(92)90150-9","volume":"37\/38","author":"N. Pippenger","year":"1992","unstructured":"N. Pippenger: The asymptotic optimality of spider-web networks. Discr. Appl. Math. 37\/38 (1992) 437\u2013450","journal-title":"Discr. Appl. Math."},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"N. Pippenger: Rearrangeable circuit-switching networks. Proc. Internat. Conf. on Graph Theory, Combinatorics, Algorithms and Applications 7 (1992) (to appear)","DOI":"10.1145\/140901.141867"},{"key":"1_CR22","first-page":"355","volume":"25","author":"N. Pippenger","year":"1993","unstructured":"N. Pippenger: Self-routing superconcentrators. Proc. ACM Symp. on Theory of Computing 25 (1993) 355\u2013361","journal-title":"Proc. ACM Symp. on Theory of Computing"},{"key":"1_CR23","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1109\/18.50385","volume":"36","author":"S. V. Ramanan","year":"1990","unstructured":"S. V. Ramanan, H. F. Jordan and J. R. Sauer: A new time-domain, multistage permutation algorithm. IEEE Trans. Info. Theory 36 (1990) 171\u2013173","journal-title":"IEEE Trans. Info. Theory"},{"key":"1_CR24","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/S0022-0000(76)80041-4","volume":"13","author":"L. G. Valiant","year":"1976","unstructured":"L. G. Valiant: Graph-theoretic properties in computational complexity. J. Computer and Sys. Science 13 (1976) 278\u2013285","journal-title":"J. Computer and Sys. Science"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Computing Theory and Practice"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58078-6_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:16:42Z","timestamp":1605647802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58078-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580782","9783540484356"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-58078-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}