{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:10:16Z","timestamp":1742598616775,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540590422"},{"type":"electronic","value":"9783540491750"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"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":[[1995]]},"DOI":"10.1007\/3-540-59042-0_78","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:58:43Z","timestamp":1330275523000},"page":"255-266","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the sizes of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks"],"prefix":"10.1007","author":[{"given":"J.","family":"Hromkovi\u010d","sequence":"first","affiliation":[]},{"given":"K.","family":"Lory\u015b","sequence":"additional","affiliation":[]},{"given":"P.","family":"Kanarek","sequence":"additional","affiliation":[]},{"given":"R.","family":"Klasing","sequence":"additional","affiliation":[]},{"given":"W.","family":"Unger","sequence":"additional","affiliation":[]},{"given":"H.","family":"Wagener","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"M. Ajtai, J. Koml\u00f3s, E. Szemer\u00e9di, An O(n log n) sorting network. Proc. 15th ACM Symposium on Theory of Computing, pp. 1\u20139, 1983.","DOI":"10.1145\/800061.808726"},{"key":"22_CR2","doi-asserted-by":"crossref","first-page":"1619","DOI":"10.1002\/j.1538-7305.1964.tb04102.x","volume":"43","author":"V. Bene\u0161","year":"1964","unstructured":"V. Bene\u0161, \u201cPermutation groups, complexes, and rearrangeable multistage Connecting networks\u201d, Bell System Technical Journal, vol. 43, pp. 1619\u20131640, 1964.","journal-title":"Bell System Technical Journal"},{"key":"22_CR3","volume-title":"Mathematical Theory of Connecting Networks and Telephone Traffic","author":"V. Bene\u0161","year":"1965","unstructured":"V. Bene\u0161, \u201cMathematical Theory of Connecting Networks and Telephone Traffic\u201d, Academic Press, New York, NY, 1965."},{"key":"22_CR4","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/0022-0000(93)90043-V","volume":"No. 47","author":"R. Cypher","year":"1993","unstructured":"R. Cypher, C.G. Plaxton: Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers. Journal of Computer and System Sciences, No. 47, 1993, pp. 501\u2013548.","journal-title":"Journal of Computer and System Sciences"},{"key":"22_CR5","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/net.3230080308","volume":"8","author":"M. Cutler","year":"1978","unstructured":"M. Cutler, Y. Shiloach: Permutation layout. Networks, vol. 8 (1978) 253\u2013278.","journal-title":"Networks"},{"key":"22_CR6","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/0022-0000(81)90040-4","volume":"No. 22","author":"O. Gabber","year":"1981","unstructured":"O. Gabber, Z. Galil: Explicit Construction of Linear-Sized Superconcentrators. Journal of Computer and System Sciences, No. 22, 1981, pp. 407\u2013420.","journal-title":"Journal of Computer and System Sciences"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"J. Hromkovi\u010d, R. Klasing, E.A. St\u00f6hr, \u201cGossiping in Vertex-Disjoint Paths Mode in Interconnection Networks\u201d, Proc. of the 19th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG'93), Springer LNCS 790, pp. 288\u2013300.","DOI":"10.1007\/3-540-57899-4_60"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"J. Hromkovi\u010d, R. Klasing, E.A. St\u00f6hr, H. Wagener, \u201cGossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs\u201d, Proc. of the First Annual European Symposium on Algorithms (ESA'93), Springer LNCS 726, pp. 200\u2013211.","DOI":"10.1007\/3-540-57273-2_56"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"J. Hromkovi\u010d, R. Klasing, W. Unger, H. Wagener, \u201cOptimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes\u201d, Proc. of the 4th Scandinavian Workshop on Algorithm Theory (SWAT'94), Springer LNCS 824, pp. 219\u2013230.","DOI":"10.1007\/3-540-58218-5_20"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"R. Klasing, \u201cThe Relationship Between Gossiping in Vertex-Disjoint Paths Mode and Bisection Width\u201d, Proc. of the 19th International Symposium on Mathematical Foundations of Computer Science (MFCS'94), Springer LNCS 841, pp. 473\u2013483.","DOI":"10.1007\/3-540-58338-6_94"},{"issue":"No.4","key":"22_CR11","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1137\/0405045","volume":"5","author":"M. Klawe","year":"1992","unstructured":"M. Klawe, T. Leighton: A tight lower bound on the size of planar permutation networks. SIAM J. Disc. Math., Vol. 5, No. 4, pp. 558\u2013563, November 1992","journal-title":"SIAM J. Disc. Math."},{"key":"22_CR12","unstructured":"M. Kuty\u0142owski, K. Lory\u015b, B. Oesterdiekhoff, R. Wanka: Fast and feasible periodic sorting networks of constant depth; Proc. 35th Annual Symposium on Foundations of Computer Science (FOCS '94), to appear."},{"key":"22_CR13","unstructured":"F.T. Leighton: Introduction to parallel algorithms and architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publisher (1992)."},{"issue":"2","key":"22_CR14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R.J. Lipton","year":"1979","unstructured":"R.J. Lipton, R.E. Tarjan, \u201cA separator theorem for planar graphs\u201d, SIAM J. Appl. Math. 36(2), 1979, pp. 177\u2013189.","journal-title":"SIAM J. Appl. Math."},{"key":"22_CR15","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0206022","volume":"No. 6","author":"N. Pippenger","year":"1977","unstructured":"N. Pippenger: Superconcentrators. SIAM Journal of Computing, No. 6, 1977, pp. 298\u2013304.","journal-title":"SIAM Journal of Computing"},{"issue":"No.3","key":"22_CR16","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1145\/321958.321962","volume":"23","author":"N. Pippenger","year":"1976","unstructured":"N. Pippenger, L. Valiant: Shifting graphs and their applications. Journal of the ACM, Vol. 23, No. 3, July 1976, pp. 423\u2013432.","journal-title":"Journal of the ACM"},{"key":"22_CR17","volume-title":"Computational Aspects of VLSI","author":"J.D. Ullman","year":"1984","unstructured":"Ullman, J.D., Computational Aspects of VLSI Computer Science Press, Rockville, MD, 1984, 495 p."},{"issue":"no.1","key":"22_CR18","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1145\/321439.321449","volume":"15","author":"A. Waksman","year":"1968","unstructured":"A. Waksman, \u201cA permutation network\u201d, Journal of the ACM, vol. 15, no. 1, pp. 159\u2013163, January 1968.","journal-title":"Journal of the ACM"},{"key":"22_CR19","unstructured":"R. Werchner, personal communication."},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"D.B. Wilson: Embedding leveled hypercube algorithms into hypercubes. Proc. 4th ACM Symposium on Parallel Algorithms and Architectures (SPAA '92), pp. 264\u2013270.","DOI":"10.1145\/140901.141881"}],"container-title":["Lecture Notes in Computer Science","STACS 95"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59042-0_78","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:41:55Z","timestamp":1742596915000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59042-0_78"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540590422","9783540491750"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-59042-0_78","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}