{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T00:04:37Z","timestamp":1759709077991,"version":"build-2065373602"},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4429,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1016\/s0304-3975(00)00141-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:59:17Z","timestamp":1027580357000},"page":"227-239","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient randomized routing algorithms on the two-dimensional mesh of buses"],"prefix":"10.1016","volume":"261","author":[{"given":"Kazuo","family":"Iwama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eiji","family":"Miyano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satoshi","family":"Tajima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hisao","family":"Tamaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00141-9_BIB1","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","article-title":"A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations","volume":"23","author":"Chernoff","year":"1952","journal-title":"Ann. Math. Statis."},{"key":"10.1016\/S0304-3975(00)00141-9_BIB2","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0020-0190(93)90208-Q","article-title":"A lower bound for permutation routing on two-dimensional bused meshes","volume":"45","author":"Cheung","year":"1993","journal-title":"Informat. Process. Lett."},{"key":"10.1016\/S0304-3975(00)00141-9_BIB3","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1006\/jpdc.1996.0052","article-title":"Minimal adaptive routing on the mesh with bounded queue size","volume":"34","author":"Chinn","year":"1996","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/S0304-3975(00)00141-9_BIB4","doi-asserted-by":"crossref","unstructured":"K. Iwama, Y. Kambayashi, E. Miyano, New bounds for oblivious mesh routing, Proc. 6th European Symp. on Algorithms, 1998, pp. 295\u2013306.","DOI":"10.1007\/3-540-68530-8_25"},{"key":"10.1016\/S0304-3975(00)00141-9_BIB5","doi-asserted-by":"crossref","unstructured":"K. Iwama, E. Miyano, Oblivious routing algorithms on the mesh of buses, Proc. Internat. Parallel Processing Symp., 1997, pp. 721\u2013727.","DOI":"10.1109\/IPPS.1997.580986"},{"key":"10.1016\/S0304-3975(00)00141-9_BIB6","doi-asserted-by":"crossref","unstructured":"K. Iwama, E. Miyano, Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing, Proc. European Symp. on Algorithms, 1997, pp. 154\u2013170.","DOI":"10.1007\/3-540-63397-9_22"},{"key":"10.1016\/S0304-3975(00)00141-9_BIB7","unstructured":"K. Iwama, E. Miyano, An O(N) oblivious routing algorithms for 2-D meshes of constant queue-size, Proc. 10th ACM-SIAM Symp. on Discrete Algorithms, 1999, pp. 466\u2013475."},{"key":"10.1016\/S0304-3975(00)00141-9_BIB8","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1006\/jagm.1996.0030","article-title":"Routing problems on the mesh of buses","volume":"20","author":"Iwama","year":"1996","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(00)00141-9_BIB9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1214\/aop\/1176996762","article-title":"On a set of almost deterministic k-independent random variables","volume":"2","author":"Joffe","year":"1974","journal-title":"Ann. Probab."},{"key":"10.1016\/S0304-3975(00)00141-9_BIB10","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/PL00009164","article-title":"Routing on meshes with buses","volume":"18","author":"Kaufmann","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(00)00141-9_BIB11","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0022-0000(91)90017-Y","article-title":"Oblivious routing with limited buffer capacity","volume":"43","author":"Krizanc","year":"1991","journal-title":"J. Comput. System Sci."},{"year":"1992","series-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"Leighton","key":"10.1016\/S0304-3975(00)00141-9_BIB12"},{"key":"10.1016\/S0304-3975(00)00141-9_BIB13","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1006\/jpdc.1994.1018","article-title":"On multidimensional packet routing for meshes with buses","volume":"20","author":"Leung","year":"1994","journal-title":"J. Parallel Distrib. Comput."},{"year":"1996","series-title":"Parallel Algorithms for Regular Architectures: Meshes and Pyramids","author":"Miller","key":"10.1016\/S0304-3975(00)00141-9_BIB14"},{"year":"1995","series-title":"Randomized Algorithms","author":"Motwani","key":"10.1016\/S0304-3975(00)00141-9_BIB15"},{"key":"10.1016\/S0304-3975(00)00141-9_BIB16","unstructured":"M. Tompa, Lecture Notes on Message Routing in Parallel Machines, Technical Report No: 94-06-05, Department of Computer Science & Engineering, University of Washington, 1994."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001419?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001419?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:52:16Z","timestamp":1759625536000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500001419"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0304397500001419"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00141-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2001,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Efficient randomized routing algorithms on the two-dimensional mesh of buses","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(00)00141-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}