{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:12:44Z","timestamp":1725459164979},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540619949"},{"type":"electronic","value":"9783540495888"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0037394","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T10:15:55Z","timestamp":1138184155000},"page":"16-33","source":"Crossref","is-referenced-by-count":3,"title":["Communication in parallel systems"],"prefix":"10.1007","author":[{"given":"Friedhelm","family":"Meyer auf der Heide","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Scheideler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,26]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"R. Aleliunas. Randomized Parallel Communication. In Proc. of the ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing, pp. 60\u201372, 1982.","DOI":"10.1145\/800220.806683"},{"issue":"3","key":"2_CR2","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/S0895480192236628","volume":"7","author":"N. Alon","year":"1994","unstructured":"N. Alon, F.R.K. Chung, R.L. Graham. Routing Permutations on Graphs via Matchings. SIAM J. Discrete Math. 7(3), pp. 513\u2013530, 1994.","journal-title":"SIAM J. Discrete Math."},{"key":"2_CR3","unstructured":"S. Bock. Optimales Wormhole Routing im hochdimensionalen Torus. Diploma thesis, Paderborn University, March 1996."},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(85)90008-X","volume":"30","author":"A. Borodin","year":"1985","unstructured":"A. Borodin, J.E. Hopcroft. Routing, merging, and sorting on parallel models of computation. Journal of Computer and System Sciences 30, pp. 130\u2013145, 1985.","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"A. Borodin, P. Raghavan, B. Schieber, E. Upfal. How much can hardware help routing? In Proc. of the 25th Ann. ACM Symposium on Theory of Computing, pp. 573\u2013582, 1993.","DOI":"10.1145\/167088.167237"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. V\u00f6cking. Universal Algorithms for Store-and-Forward and Wormhole Routing. In 28th Ann. ACM Symp. on Theory of Computing, pp. 356\u2013365, 1996.","DOI":"10.1145\/237814.237982"},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","volume":"33","author":"T. Hagerup","year":"1989\/90","unstructured":"T. Hagerup, C. R\u00fcb. A Guided Tour of Chernoff Bounds. Information Processing Letters 33, pp. 305\u2013308, 1989\/90.","journal-title":"Information Processing Letters"},{"key":"2_CR8","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF02090400","volume":"24","author":"C. Kaklamanis","year":"1991","unstructured":"C. Kaklamanis, D. Krizanc, T. Tsantilas. Tigth Bounds for Oblivious Routing in the Hypercube. Mathematical Systems Theory 24, pp. 223\u2013232, 1991.","journal-title":"Mathematical Systems Theory"},{"key":"2_CR9","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"F.T. Leighton","year":"1992","unstructured":"F.T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo, CA, 1992."},{"key":"2_CR10","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1006\/jagm.1994.1030","volume":"17","author":"F.T. Leighton","year":"1994","unstructured":"F.T. Leighton, B.M. Maggs, A.G. Ranade, S.B. Rao. Randomized Routing and Sorting on Fixed-Connection Networks. Journal of Algorithms 17, pp. 157\u2013205, 1994.","journal-title":"Journal of Algorithms"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"F.T. Leighton, B.M. Maggs, S.B. Rao. Universal Packet Routing Algorithms. In Proc. of the 29th Ann. Symp. on Foudations of Computer Science, pp. 256\u2013271, 1988.","DOI":"10.21236\/ADA204273"},{"key":"2_CR12","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF01215349","volume":"14","author":"F.T. Leighton","year":"1994","unstructured":"F.T. Leighton, B.M. Maggs, S.B. Rao. Packet Routing and Job-Shop Scheduling in O (Congestion + Dilation) Steps. Combinatorica 14, pp. 167\u2013186, 1994.","journal-title":"Combinatorica"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"T. Leighton, S. Rao. An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms. In Proc. of the 29th Ann. IEEE Symp. on Foundations of Computer Science, pp. 422\u2013431, 1988.","DOI":"10.1109\/SFCS.1988.21958"},{"key":"2_CR14","unstructured":"F. Meyer auf der Heide, C. Scheideler. Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. To appear at Proc. of the 37th Ann. IEEE Symp. on Foundations of Computer Science, 1996."},{"key":"2_CR15","first-page":"291","volume":"95","author":"F. Meyer auf der Heide","year":"1995","unstructured":"F. Meyer auf der Heide, B. V\u00f6cking. A Packet Routing Protocol for Arbitrary Networks. In 12th Symp. on Theoretical Aspects of Computer Science (STACS 95), pp. 291\u2013302, 1995.","journal-title":"12th Symp. on Theoretical Aspects of Computer Science"},{"key":"2_CR16","unstructured":"F. Meyer auf der Heide, B. V\u00f6cking. Universal Store-and-Forward Routing. Technical Report, Paderborn University, 1996."},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"F. Meyer auf der Heide, R. Wanka. Kommunikation in parallelen Rechnernetzen (in German). In Highlights aus der Informatik, I. Wegener (editor), Springer Verlag, pp. 177\u2013198, 1996.","DOI":"10.1007\/978-3-642-61012-7_10"},{"key":"2_CR18","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF01840387","volume":"5","author":"I. Parberry","year":"1990","unstructured":"I. Parberry. An Optimal Time Bound for Oblivious Routing. Algorithmica 5, pp. 243\u2013250, 1990.","journal-title":"Algorithmica"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"N. Pippenger. Parallel Communication with Limited Buffers. In Proc. of the 25th IEEE Symp. on Foundations of Computer Science, pp. 127\u2013136, 1984.","DOI":"10.1109\/SFCS.1984.715909"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Y. Rabani, \u00c9. Tardos. Distributed Packet Switching in Arbitrary Networks. In 28th Ann. ACM Symp. on Theory of Computing, pp. 366\u2013375, 1996.","DOI":"10.1145\/237814.237983"},{"key":"2_CR21","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0022-0000(91)90005-P","volume":"42","author":"A.G. Ranade","year":"1991","unstructured":"A.G. Ranade. How to Emulate Shared Memory. Journal of Computer and System Sciences 42, pp. 307\u2013326, 1991.","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR22","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/0304-3975(93)90031-N","volume":"112","author":"O. S\u00fdkora","year":"1993","unstructured":"O. S\u00fdkora, I. Vr\u0165o. Edge Seperators for Graphs of Bounded Genus with Applications. Theoretical Computer Science 112, pp. 419\u2013429, 1993.","journal-title":"Theoretical Computer Science"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"E. Upfal. Efficient Schemes for Parallel Communication. In Proc. of the ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing, pp. 241\u2013250, 1982.","DOI":"10.1145\/800220.806682"},{"issue":"2","key":"2_CR24","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1137\/0211027","volume":"11","author":"L.G. Valiant","year":"1982","unstructured":"L.G. Valiant. A Scheme for Fast Parallel Communication. SIAM Journal of Computing 11(2), pp. 350\u2013361, 1982.","journal-title":"SIAM Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","SOFSEM'96: Theory and Practice of Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0037394","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T10:34:29Z","timestamp":1555410869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0037394"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540619949","9783540495888"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/bfb0037394","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}