{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:42Z","timestamp":1759638042364},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648482"},{"type":"electronic","value":"9783540685302"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-68530-8_25","type":"book-chapter","created":{"date-parts":[[2007,11,8]],"date-time":"2007-11-08T17:14:16Z","timestamp":1194542056000},"page":"295-306","source":"Crossref","is-referenced-by-count":4,"title":["New Bounds for Oblivious Mesh Routing"],"prefix":"10.1007","author":[{"given":"Kazuo","family":"Iwama","sequence":"first","affiliation":[]},{"given":"Yahiko","family":"Kambayashi","sequence":"additional","affiliation":[]},{"given":"Eiji","family":"Miyano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"A. Bar-Noy, P. Raghavan, B. Schieber and H. Tamaki, \u201cFast deflection routing for packets and worms,\u201d In Proc. ACM Symposium on Principles of Distributed Computing (1993) 75\u201386.","DOI":"10.1145\/164051.164062"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0022-0000(85)90008-X","volume":"30","author":"A. Borodin","year":"1985","unstructured":"A. Borodin and J.E. Hopcroft, \u201cRouting, merging, and sorting on parallel models of computation,\u201d J. Computer and System Sciences 30 (1985) 130\u2013145.","journal-title":"J. Computer and System Sciences"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"A. Borodin, P. Raghavan, B. Schieber and E. Upfal, \u201cHow much can hardware help routing?,\u201d In Proc. ACM Symposium on Theory of Computing (1993) 573\u2013582.","DOI":"10.1145\/167088.167237"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1006\/jpdc.1996.0052","volume":"34","author":"D.D. Chinn","year":"1996","unstructured":"D.D. Chinn, T. Leighton and M. Tompa, \u201cMinimal adaptive routing on the mesh with bounded queue size,\u201d J. Parallel and Distributed Computing 34 (1996) 154\u2013170.","journal-title":"J. Parallel and Distributed Computing"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"K. Iwama and E. Miyano, \u201cThree-dimensional meshes are less powerful than two-dimensional ones in oblivious routing,\u201d In Proc. 5th European Symposium on Algorithms (1997) 284\u2013295.","DOI":"10.1007\/3-540-63397-9_22"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF02090400","volume":"24","author":"C. Kaklamanis","year":"1991","unstructured":"C. Kaklamanis, D. Krizanc and A. Tsantilas, \u201cTight bounds for oblivious routing in the hypercube,\u201d Mathematical Systems Theory 24 (1991) 223\u2013232.","journal-title":"Mathematical Systems Theory"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"C. Kaklamanis, D. Krizanc and S. Rao, \u201cSimple path selection for optimal routing on processor arrays,\u201d In Proc. 1992 ACM Symposium on Parallel Algorithms and Architectures (1992) 23\u201330.","DOI":"10.1145\/140901.140904"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0022-0000(91)90017-Y","volume":"43","author":"D. Krizanc","year":"1991","unstructured":"D. Krizanc, \u201cOblivious routing with limited buffer capacity,\u201d J. Computer and System Sciences 43 (1991) 317\u2013327.","journal-title":"J. Computer and System Sciences"},{"key":"25_CR9","unstructured":"F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann (1992)."},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF01294128","volume":"14","author":"F.T. Leighton","year":"1995","unstructured":"F.T. Leighton, F. Makedon and I. Tollis, \u201cA 2n \u2014 2 step algorithm for routing in an n \u00d7 n array with constant queue sizes,\u201d Algorithmica 14 (1995) 291\u2013304.","journal-title":"Algorithmica"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/jagm.1995.0804","volume":"22","author":"J.F. Sibeyn","year":"1997","unstructured":"J.F. Sibeyn, B.S. Chlebus and M. Kaufmann, \u201cDeterministic permutation routing on meshes,\u201d J. Algorithms 22 (1997) 111\u2013141.","journal-title":"J. Algorithms"},{"key":"25_CR12","unstructured":"M. Tompa, Lecture notes on message routing in parallel machines, Technical Report # 94-06-05, Dept of Computer Sci. & Eng., Univ of Washington (1994)."},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"L.G. Valiant and G.J. Brebner, \u201cUniversal schemes for parallel communication,\u201d In Proc. ACM Symposium on Theory of Computing (1981) 263\u2013277.","DOI":"10.1145\/800076.802479"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA\u2019 98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-68530-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T21:47:01Z","timestamp":1551044821000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68530-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648482","9783540685302"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-68530-8_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}