{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:11:07Z","timestamp":1725664267790},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540583387"},{"type":"electronic","value":"9783540486633"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58338-6_106","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:52:09Z","timestamp":1330253529000},"page":"597-607","source":"Crossref","is-referenced-by-count":2,"title":["Shorter queues for permutation routing on meshes"],"prefix":"10.1007","author":[{"given":"Jop F.","family":"Sibeyn","sequence":"first","affiliation":[]},{"given":"Bogdan S.","family":"Chlebus","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Chlebus, B.S., M. Kaufmann, J.F. Sibeyn, \u2018Deterministic Permutation Routing on Meshes,\u2019 Proc. 5th Symp. on Parallel and Distributed Proc., pp. 814\u2013821, IEEE, 1993.","key":"52_CR1","DOI":"10.1109\/SPDP.1993.395448"},{"doi-asserted-by":"crossref","unstructured":"Kunde, M., \u2018Routing and Sorting on Mesh Connected Processor Arrays,\u2019 Proc. VLSI Algorithms and Architectures, Lecture Notes in Computer Science 319, pp. 423\u2013433, Springer-Verlag, 1988.","key":"52_CR2","DOI":"10.1007\/BFb0040409"},{"doi-asserted-by":"crossref","unstructured":"Leighton, T., F. Makedon, Y. Tollis, \u2018A 2n \u22122 Step Algorithm for Routing in an n \u00d7 n Array with Constant Size Queues,\u2019 Proc. Symposium on Parallel Algorithms and Architectures, pp. 328\u2013335, ACM, 1989.","key":"52_CR3","DOI":"10.1145\/72935.72970"},{"doi-asserted-by":"crossref","unstructured":"Rajasekaran, S., R. Overholt, \u2018Constant Queue Routing on a Mesh,\u2019 Journal of Parallel and Distributed Computing, pp. 160\u2013166, 1992.","key":"52_CR4","DOI":"10.1016\/0743-7315(92)90108-Y"},{"key":"52_CR5","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01758834","volume":"8","author":"S. Rajasekaran","year":"1992","unstructured":"Rajasekaran, S., Th. Tsantilas, \u2018Optimal Routing Algorithms for Mesh-Connected Processor Arrays,\u2019 Algorithmica 8, pp. 21\u201338, 1992.","journal-title":"Algorithmica"},{"unstructured":"Sibeyn, J.F., \u2018Desnakification of Mesh Sorting Algorithms,\u2019 Techn. Rep. MPI-I-94-102, Max-Planck Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany, submitted to ESA '94.","key":"52_CR6"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1994"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58338-6_106.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:19:44Z","timestamp":1605629984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58338-6_106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540583387","9783540486633"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-58338-6_106","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}