{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:10:52Z","timestamp":1743027052512,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038686"},{"type":"electronic","value":"9783642038693"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","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":[[2009]]},"DOI":"10.1007\/978-3-642-03869-3_92","type":"book-chapter","created":{"date-parts":[[2009,8,22]],"date-time":"2009-08-22T04:04:48Z","timestamp":1250913888000},"page":"1003-1010","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Lower Bound for Oblivious Dimensional Routing"],"prefix":"10.1007","author":[{"given":"Andre","family":"Osterloh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"92_CR1","doi-asserted-by":"crossref","unstructured":"Borodin, A., Hopcroft, J.E.: Routing, merging, and sorting on parallel models of computation. In: Proceedings of the 14th Annual ACM Symposium on the Theory of Computing, pp. 338\u2013344 (1982)","DOI":"10.1145\/800070.802209"},{"key":"92_CR2","doi-asserted-by":"crossref","unstructured":"Borodin, A., Raghavan, P., Schieber, B., Upfal, E.: How much can hardware help routing? In. In: Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, pp. 573\u2013582 (1993)","DOI":"10.1145\/167088.167237"},{"issue":"2","key":"92_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1006\/jpdc.1998.1483","volume":"54","author":"M.D. Grammatikakis","year":"1998","unstructured":"Grammatikakis, M.D., Hsu, D.F., Sibeyn, J.F.: Packet routing in fixed-connection networks: A survey. Journal of Parallel and Distributed Computing\u00a054(2), 77\u2013132 (1998)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"92_CR4","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1006\/jagm.2000.1152","volume":"39","author":"K. Iwama","year":"2001","unstructured":"Iwama, K., Miyano, E.: A lower bound for elementary oblivious routing on three-dimensional meshes. Journal of Algorithms\u00a039, 145\u2013161 (2001)","journal-title":"Journal of Algorithms"},{"key":"92_CR5","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1006\/jagm.2001.1176","volume":"41","author":"K. Iwama","year":"2001","unstructured":"Iwama, K., Miyano, E.: An O($\\sqrt {N}$) oblivious routing algorithm for 2-D meshes of constant queue-size. Journal of Algorithms\u00a041, 262\u2013279 (2001)","journal-title":"Journal of Algorithms"},{"issue":"4","key":"92_CR6","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF02090400","volume":"24","author":"C. Kaklamanis","year":"1991","unstructured":"Kaklamanis, C., Krizanc, D., Tsantilas, T.: Tight bounds for oblivious routing in the hypercube. Mathematical Systems Theory\u00a024(4), 223\u2013232 (1991)","journal-title":"Mathematical Systems Theory"},{"issue":"2","key":"92_CR7","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0022-0000(91)90017-Y","volume":"43","author":"D. Krizanc","year":"1991","unstructured":"Krizanc, D.: Oblivious routing with limited buffer capacity. Journal of Computer and System Sciences\u00a043(2), 317\u2013327 (1991)","journal-title":"Journal of Computer and System Sciences"},{"key":"92_CR8","doi-asserted-by":"crossref","unstructured":"Krizanc, D., Peleg, D., Upfal, E.: A time-randomness tradeoff for oblivious routing. In: Proceedings of the 20th Annual ACM Symposium on the Theory of Computing, pp. 93\u2013102 (1988)","DOI":"10.1145\/62212.62221"},{"key":"92_CR9","volume-title":"Introduction to Parallel Algorithms and Architectures","author":"F.T. Leighton","year":"1992","unstructured":"Leighton, F.T.: Introduction to Parallel Algorithms and Architectures. Morgan Kaufman, San Mateo (1992)"},{"issue":"4","key":"92_CR10","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1142\/S0219265901000488","volume":"2","author":"A. Litman","year":"2001","unstructured":"Litman, A., Moran-Schein, S.: Fast, minimal, and oblivious routing algorithms on the mesh with bounded queues. Journal of Interconnection Networks\u00a02(4), 445\u2013469 (2001)","journal-title":"Journal of Interconnection Networks"},{"key":"92_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/BFb0037394","volume-title":"SOFSEM \u201996: Theory and Practice of Informatics","author":"F. Meyer auf der Heide","year":"1996","unstructured":"Meyer auf der Heide, F., Scheideler, C.: Communication in parallel systems. In: Kr\u00e1l, J., Bartosek, M., Jeffery, K. (eds.) SOFSEM 1996. LNCS, vol.\u00a01175, pp. 16\u201334. Springer, Heidelberg (1996)"},{"key":"92_CR12","unstructured":"Osterloh, A.: Oblivious routing on d-dimensional meshes. In: Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity, pp. 305\u2013320. Carleton Scientific (2001)"},{"key":"92_CR13","unstructured":"Osterloh, A.: Aspects of k-k routing in Meshes and OTIS Networks. Ph.d. thesis, Technical University of Ilmenau (2002)"},{"key":"92_CR14","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BF01840387","volume":"5","author":"I. Parberry","year":"1990","unstructured":"Parberry, I.: An optimal time bound for oblivious routing. Algorithmica\u00a05, 243\u2013250 (1990)","journal-title":"Algorithmica"},{"key":"92_CR15","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF01758834","volume":"8","author":"S. Rajasekaran","year":"1992","unstructured":"Rajasekaran, S., Tsantilas, T.: Optimal routing algorithms for mesh-connected processor arrays. Algorithmica\u00a08, 21\u201338 (1992)","journal-title":"Algorithmica"},{"key":"92_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/3-540-57785-8_145","volume-title":"STACS 94","author":"J.F. Sibeyn","year":"1994","unstructured":"Sibeyn, J.F., Kaufmann, M.: Deterministic 1-k routing on meshes. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol.\u00a0775, pp. 237\u2013248. Springer, Heidelberg (1994)"},{"issue":"2","key":"92_CR17","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1137\/0211027","volume":"11","author":"L.G. Valiant","year":"1982","unstructured":"Valiant, L.G.: A scheme for fast parallel communication. SIAM Journal on Computing\u00a011(2), 350\u2013361 (1982)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2009 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03869-3_92","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T13:56:54Z","timestamp":1589896614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03869-3_92"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038686","9783642038693"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03869-3_92","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}