{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T01:30:06Z","timestamp":1676683806881},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1995,10,1]],"date-time":"1995-10-01T00:00:00Z","timestamp":812505600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1995,10]]},"DOI":"10.1007\/bf01294128","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T03:39:08Z","timestamp":1111721948000},"page":"291-304","source":"Crossref","is-referenced-by-count":14,"title":["A 2n?2 step algorithm for routing in ann \ufffdn array with constant-size queues"],"prefix":"10.1007","volume":"14","author":[{"given":"T.","family":"Leighton","sequence":"first","affiliation":[]},{"given":"F.","family":"Makedon","sequence":"additional","affiliation":[]},{"given":"I. G.","family":"Tollis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"D. Kirzanc, S. Rajasekaran, and T. Tsantilas, Optimal Routing Algorithms for Mesh-Connected Processor Arrays,VLSI Algorithms and Architectures: Proc. AWOC'88, Lecture Notes in Computer Science, Vol. 319, Springer-Verlag, Berlin, pp. 411?422.","DOI":"10.1007\/BFb0040408"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"M. Kunde, Routing and Sorting on Mesh-Connected Arrays,VLSI Algorithms and Architectures: Proc. AWOC'88, Lecture Notes in Computer Science, Vol. 319, Springer-Verlag, Berlin, pp. 423?433.","DOI":"10.1007\/BFb0040409"},{"key":"CR3","volume-title":"Introducton to Parallel Algorithms and Architectures: Arrays \u00b7 Trees \u00b7 Hypercubes","author":"F. T. Leighton","year":"1992","unstructured":"F. T. Leighton,Introducton to Parallel Algorithms and Architectures: Arrays \u00b7 Trees \u00b7 Hypercubes, Morgan Kaufman, San Mateo, CA, 1992."},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"F. T. Leighton, Methods for Message Routing in Parallel Machines,Proc. 24th ACM Symp. on Theory of Computing, May 1992, pp. 77?96. (Also inTheoretical Computer Science, Vol. 129, July 1994, pp. 31?62.)","DOI":"10.1016\/0304-3975(94)90163-5"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"F. T. Leighton, F. Makedon, and I. Tollis, A (2n?2)-Step Algorithm for Routing in anN \u00d7N Array with Constant Size Queues,Proc. 1st ACM Symp. on Parallel Algorithms and Architectures, June 1989, pp. 328?335.","DOI":"10.1145\/72935.72970"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"S. Rajasekaran and R. Overholt, Constant Queue Routing on a Mesh,Proc. 8th Annual Symp. on Theoretical Aspects of Computer Science, edited by C. Choffrut and M. Jantzen, Lecture Notes in Computer Science, Vol. 480, Springer-Verlag, Berlin, pp. 444?455.","DOI":"10.1007\/BFb0020819"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"C. Schnorr and A. Shamir, An Optimal Sorting Algorithm for Mesh Connected Computers,Proc. 18th ACM Symp. on Theory of Computing, 1986, pp. 255?263.","DOI":"10.1145\/12130.12156"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1145\/359461.359481","volume":"20","author":"C. Thompson","year":"1977","unstructured":"C. Thompson and H. T. Kung, Sorting on a Mesh-Connected Parallel Computer,Communications of the Association for Computing Machinery, Vol. 20, 1977, pp. 263?270.","journal-title":"Communications of the Association for Computing Machinery"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01294128.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01294128\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01294128","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T13:48:30Z","timestamp":1586180910000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01294128"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,10]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1995,10]]}},"alternative-id":["BF01294128"],"URL":"https:\/\/doi.org\/10.1007\/bf01294128","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,10]]}}}