{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:40:08Z","timestamp":1742596808325,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540577850"},{"type":"electronic","value":"9783540483328"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57785-8_144","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:19:14Z","timestamp":1330262354000},"page":"225-236","source":"Crossref","is-referenced-by-count":6,"title":["Faster sorting and routing on grids with diagonals"],"prefix":"10.1007","author":[{"given":"Manfred","family":"Kunde","sequence":"first","affiliation":[]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Rossmanith","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"C. Kaklamanis and D. Krizanc. Optimal sorting on mesh-connected processor arrays. In Proc. of 3d SPAA, pages 50\u201359, 1992.","DOI":"10.1145\/140901.140907"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"M. Kaufmann, S. Rajasekaran, and J. F. Sibeyn. Matching the bisection bound for routing and sorting on the mesh. In Proc. of 3d SPAA, pages 31\u201340, 1992.","DOI":"10.1145\/140901.140905"},{"key":"18_CR3","unstructured":"M. Kaufmann and J. F. Sibeyn. Optimal k-k sorting on meshes and tori. 1993."},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"M. Kunde. Concentrated regular data streans on grids: Sorting and routing near to the bisection bound. In Proc. of 32d FOCS, pages 141\u2013150, 1991.","DOI":"10.1109\/SFCS.1991.185363"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"M. Kunde. Block gossiping on grids and tori: Sorting and routing match the bisection bound deterministically. In Proc. of 1st ESA, volume 726 of Lecture Notes in Computer Science, pages 272\u2013283, 1993.","DOI":"10.1007\/3-540-57273-2_62"},{"key":"18_CR6","unstructured":"H. T. Kung and C. E. Leiserson. Systolic arrays (for VLSI). In I. S. Duff and G. W. Stewart, editors, Sparse Matrix Proceedings 1978, pages 256\u2013282. Society for Industrial and Applied Mathematics, 1979."},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, 1992.","DOI":"10.1016\/B978-1-4832-0772-8.50005-4"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"T. Leighton, F. Makedon, and I. Tollis. A 2n \u2014 2 step algorithm for routing in an n \u00d7 n array with constant size queues. In Proc. of 1st SPAA, pages 328\u2013335, 1989.","DOI":"10.1145\/72935.72970"},{"key":"18_CR9","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1016\/0743-7315(90)90083-2","volume":"9","author":"A. Park","year":"1990","unstructured":"A. Park and K. Balasubramanian. Reducing communication costs for sorting on mesh-connected and linearly connected parallel computers. Journal of Parallel and Distributed Computing, 9:318\u2013322, 1990.","journal-title":"Journal of Parallel and Distributed Computing"}],"container-title":["Lecture Notes in Computer Science","STACS 94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57785-8_144.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:12:55Z","timestamp":1742595175000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57785-8_144"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540577850","9783540483328"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-57785-8_144","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}