{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T14:49:17Z","timestamp":1787496557734,"version":"build-2736575974"},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,8,1]],"date-time":"1992-08-01T00:00:00Z","timestamp":712627200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1992,8]]},"DOI":"10.1016\/0020-0190(92)90019-r","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:45:40Z","timestamp":1027640740000},"page":"101-105","source":"Crossref","is-referenced-by-count":3,"title":["Mesh permutation routing with locality"],"prefix":"10.1016","volume":"43","author":[{"given":"Steven","family":"Cheung","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francis C.M.","family":"Lau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90019-R_BIB1","first-page":"236","article-title":"Move and smooth routing algorithms on mesh-connected computers","author":"Han","year":"1990","journal-title":"Proc. 28th Ann. Allerton Conf. on Communication, Control, and Computing"},{"key":"10.1016\/0020-0190(92)90019-R_BIB2","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1109\/SPDP.1991.218265","article-title":"Off-line routing with small queues on a mesh-connected processor array (Extended abstract)","author":"Krizanc","year":"1991","journal-title":"Proc. 3rd IEEE Symp. on Parallel and Distributed Processing"},{"key":"10.1016\/0020-0190(92)90019-R_BIB3","first-page":"411","article-title":"Optimal routing algorithms for mesh-connected processor arrays","volume":"319","author":"Krizanc","year":"1988"},{"key":"10.1016\/0020-0190(92)90019-R_BIB4","first-page":"423","article-title":"Routing and sorting on mesh-connected arrays","volume":"319","author":"Kunde","year":"1988"},{"key":"10.1016\/0020-0190(92)90019-R_BIB5","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0743-7315(91)90120-X","article-title":"(k-k) Routing on multidimensional mesh-connected arrays","volume":"11","author":"Kunde","year":"1991","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/0020-0190(92)90019-R_BIB6","doi-asserted-by":"crossref","unstructured":"T. Leighton, Average case analysis of greedy routing algorithms on arrays, in: Proc. 1990 ACM Symp. on Parallel Algorithms and Architectures, pp. 2-10.","DOI":"10.1145\/97444.97448"},{"key":"10.1016\/0020-0190(92)90019-R_BIB7","unstructured":"T. Leighton, F. Makedon and I.G. Tollis, A 2n - 2 step algorithm for routing in an n x n array with constant size queues, in: Proc. 1989 ACM Symp. on Parallel Algorithms and Architectures, pp. 328-335."},{"issue":"5","key":"10.1016\/0020-0190(92)90019-R_BIB8","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1109\/12.53582","article-title":"Emulation of hypercube architecture on nearest-neighbor mesh-connected processing elements","volume":"39","author":"Matic\u0300","year":"1990","journal-title":"IEEE Trans. Comput."},{"issue":"12","key":"10.1016\/0020-0190(92)90019-R_BIB9","doi-asserted-by":"crossref","first-page":"1446","DOI":"10.1109\/12.61064","article-title":"Embedding rectangular grids into square grids with dilation two","volume":"39","author":"Melhem","year":"1990","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(92)90019-R_BIB10","first-page":"257","article-title":"Embedding one interconnection network in another","author":"Monien","year":"1990"},{"key":"10.1016\/0020-0190(92)90019-R_BIB11","first-page":"226","article-title":"An optimal randomized algorithm for the mesh and a class of efficient mesh-like routing networks","volume":"287","author":"Rajasekaran","year":"1987"},{"key":"10.1016\/0020-0190(92)90019-R_BIB12","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/MC.1987.1663593","article-title":"The performance of multicomputer interconnection networks","volume":"20","author":"Reed","year":"1987","journal-title":"IEEE Comput."},{"key":"10.1016\/0020-0190(92)90019-R_BIB13","first-page":"255","article-title":"An optimal sorting algorithm for mesh connected computers","author":"Schnorr","year":"1986","journal-title":"Proc. 18th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(92)90019-R_BIB14","first-page":"850","article-title":"Simulating parallel neighboring communications among square meshes and square toruses","author":"Tao","year":"1990","journal-title":"Proc. 2nd IEEE Symp. on Parallel and Distributed Processing"},{"key":"10.1016\/0020-0190(92)90019-R_BIB15","first-page":"263","article-title":"Universal schemes for parallel communication","author":"Valiant","year":"1981","journal-title":"Proc. 13th Ann. ACM Symp. on Theory of Computing"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290019R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290019R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:21:25Z","timestamp":1555118485000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290019R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,8]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,8]]}},"alternative-id":["002001909290019R"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90019-r","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,8]]}}}