{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:26:40Z","timestamp":1725460000420},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584346"},{"type":"electronic","value":"9783540487944"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/bfb0049424","type":"book-chapter","created":{"date-parts":[[2006,3,6]],"date-time":"2006-03-06T18:42:35Z","timestamp":1141670555000},"page":"377-390","source":"Crossref","is-referenced-by-count":8,"title":["Desnakification of mesh sorting algorithms"],"prefix":"10.1007","author":[{"given":"Jop F.","family":"Sibeyn","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,2,23]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Kaklamanis, C., D. Krizanc, \u2018Optimal Sorting on Mesh-Connected Processor Arrays,\u2019 Proc. 4th Symp. on Parallel Algorithms and Architectures, pp. 50\u201359, ACM, 1992.","DOI":"10.1145\/140901.140907"},{"key":"34_CR2","unstructured":"Kaufmann, M., J.F. Sibeyn, \u2018Randomized k-k Sorting on Meshes and Tori,\u2019 manuscript, 1992."},{"key":"34_CR3","unstructured":"Kaufmann, M., J.F. Sibeyn, T. Suel, \u2018Derandomizing Algorithms for Routing and Sorting on Meshes,\u2019 Proc. 5th Symp. on Discrete Algorithms, pp 669\u2013679 ACM-SIAM, 1994."},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Krizanc, D., L. Narayanan, \u2018Zero-One Sorting on the Mesh,\u2019 Proc. 5th Symp. on Parallel and Distributed Processing, IEEE, pp. 641\u2013647, 1993.","DOI":"10.1109\/SPDP.1993.395473"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Kunde, M., \u2018Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound,\u2019 Proc. European Symp. on Algorithms, LNCS 726, pp. 272\u2013283, Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57273-2_62"},{"key":"34_CR6","unstructured":"Newman, I., A. Schuster, \u2018Hot-Potato Algorithms for Permutation Routing,\u2019 Proc. ISTCS, June 1993."},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Schnorr, C.P., A. Shamir, \u2018An Optimal Sorting Algorithm for Mesh Connected Computers,\u2019 Proc. 18th Symp. on Theory of Comp., pp. 255\u2013263, ACM, 1986.","DOI":"10.1145\/12130.12156"},{"key":"34_CR8","volume-title":"Techn. Rep. MPI-I-94-102","author":"J.F. Sibeyn","year":"1994","unstructured":"Sibeyn, J.F., \u2018Desnakification of Mesh Sorting Algorithms,\u2019 Techn. Rep. MPI-I-94-102, revised and extended version, Max-Planck Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany, 1994."},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Sibeyn, J.F., B.S. Chlebus, M. Kaufmann, \u2018Permutation Routing on Meshes with Small Queues,\u2019 Proc. 19th Mathematical Foundations of Computer Science, LNCS, Springer Verlag, 1994, to appear.","DOI":"10.1007\/3-540-58338-6_106"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA '94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0049424","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T05:56:25Z","timestamp":1555480585000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0049424"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584346","9783540487944"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0049424","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}