{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:21:38Z","timestamp":1757625698516,"version":"3.44.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T00:00:00Z","timestamp":1108684800000},"content-version":"vor","delay-in-days":4431,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Microprocessors and Microsystems"],"published-print":{"date-parts":[[1993]]},"DOI":"10.1016\/0141-9331(93)90056-d","type":"journal-article","created":{"date-parts":[[2003,3,15]],"date-time":"2003-03-15T01:33:26Z","timestamp":1047692006000},"page":"361-367","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":11,"title":["Optimal algorithms for the many-to-one routing problem on two-dimensional meshes"],"prefix":"10.1016","volume":"17","author":[{"given":"Fillia","family":"Makedon","sequence":"first","affiliation":[]},{"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0141-9331(93)90056-D_BIB1","series-title":"Proceedings of ACM Symposium on Parallel Algorithms and Architectures, SPAA '89","first-page":"328","article-title":"A 2n-2 algorithm for routing in an n \u00d7 n array with constant size queues","author":"Leighton","year":"1989"},{"key":"10.1016\/0141-9331(93)90056-D_BIB2","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0743-7315(92)90108-Y","article-title":"Constant queue routing on a mesh","volume":"Vol 15","author":"Rajasekaran","year":"1992","journal-title":"J. Parall. Distrib. Comput."},{"key":"10.1016\/0141-9331(93)90056-D_BIB3","series-title":"Proceedings of the 3rd Symposium on the Frontiers of Massively Parallel Computation","first-page":"294","article-title":"On bit-serial packet routing for the mesh and the torus","author":"Makedon","year":"1990"},{"key":"10.1016\/0141-9331(93)90056-D_BIB4","series-title":"Proceedings 18th ACM Symposium on Theory of Computing","first-page":"255","article-title":"An optimal sorting algorithm for mesh connected computers","author":"Schnorr","year":"1986"},{"key":"10.1016\/0141-9331(93)90056-D_BIB5","series-title":"VLSI Algorithms and Architectures (AWOC '88)","first-page":"411","article-title":"Optimal routing algorithms for mesh-connected processor arrays","volume":"319","author":"Krizanc","year":"1988"},{"key":"10.1016\/0141-9331(93)90056-D_BIB6","series-title":"VLSI Algorithms and Architectures (AWOC '88)","first-page":"423","article-title":"Routing and sorting on mesh-connected arrays","volume":"319","author":"Kunde","year":"1988"}],"container-title":["Microprocessors and Microsystems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:014193319390056D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:014193319390056D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T19:11:11Z","timestamp":1757445071000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/014193319390056D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"references-count":6,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1993]]}},"alternative-id":["014193319390056D"],"URL":"https:\/\/doi.org\/10.1016\/0141-9331(93)90056-d","relation":{},"ISSN":["0141-9331"],"issn-type":[{"type":"print","value":"0141-9331"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimal algorithms for the many-to-one routing problem on two-dimensional meshes","name":"articletitle","label":"Article Title"},{"value":"Microprocessors and Microsystems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0141-9331(93)90056-D","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1993 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}