{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:43Z","timestamp":1725664243867},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540580782"},{"type":"electronic","value":"9783540484356"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58078-6_12","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:09:48Z","timestamp":1330268988000},"page":"121-136","source":"Crossref","is-referenced-by-count":2,"title":["Sorting and selection on arrays with diagonal connections"],"prefix":"10.1007","author":[{"given":"Danny","family":"Krizanc","sequence":"first","affiliation":[]},{"given":"Lata","family":"Narayanan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"A. Agarwal, B. Lim, D. Kranz, and J. Kubiatowicz. APRIL: A processor architecture for multiprocessing. In Proceedings of the 17th Annual International Symposium on Computer Architecture, pages 104\u2013114, 1990.","DOI":"10.1145\/325164.325119"},{"key":"12_CR2","unstructured":"A. Condon and L. Narayanan. Upper and lower bounds for selection on the mesh. Unpublished manuscript, 1993."},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"C. Kaklamanis and D. Krizanc. Optimal sorting on mesh-connected processor arrays. In Symposium on Parallel Algorithms and Architecture, pages 50\u201359, 1992.","DOI":"10.1145\/140901.140907"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"C. Kaklamanis, D. Krizanc, L. Narayanan, and A. Tsantilas. Randomized sorting and selection on mesh-connected processor arrays. In Symposium on Parallel Algorithms and Architecture, pages 17\u201328, 1991.","DOI":"10.1145\/113379.113381"},{"key":"12_CR5","unstructured":"D. Krizanc, L. Narayanan, and R. Raman. A lower bound for sorting on the mesh. Submitted for publication, 1993."},{"key":"12_CR6","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF00264359","volume":"24","author":"M. Kunde","year":"1987","unstructured":"M. Kunde. Lower bounds for sorting on mesh-connected architectures. Acta Informatica, 24:121\u2013130, 1987.","journal-title":"Acta Informatica"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"M. Kunde, R. Niedermeier, and P. Rossmanith. Faster sorting and routing on grids with diagonals. In Symposium on Theoretical Aspects of Computer Science, 1994.","DOI":"10.1007\/3-540-57785-8_144"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"F. Leighton, F. Makedon, and I. Tollis. A 2n\u22122 step algorithm for routing in an n \u00d7 n array with constant size queues. In Symposium on Parallel Algorithms and Architecture, pages 328\u2013335, 1989.","DOI":"10.1145\/72935.72970"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"D. Lenoski, J. Laudon, K. Gharachorloo, A. Gupta, and J. Hennessy. The directory-based cache coherence protocol for the DASH multiprocessor. In Proceedings of the 17th Annual International Symposium on Computer Architecture, pages 148\u2013159, 1990.","DOI":"10.1145\/325096.325132"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"S. L. Lillevik. Touchstone program overview. In Proceedings of the 5th Distributed Memory Computing Conference, Charleston, SC, April 9\u201312 1990.","DOI":"10.1109\/DMCC.1990.556265"},{"key":"12_CR11","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01758834","volume":"8","author":"S. Rajasekaran","year":"1992","unstructured":"S. Rajasekaran and T. Tsantilas. Optimal algorithms for routing on the mesh. Algorithmica, 8:21\u201338, 1992.","journal-title":"Algorithmica"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"C. Schnorr and A. Shamir. An optimal sorting algorithm for mesh-connected computers. In Symposium on the Theory of Computation, pages 255\u2013263, 1986.","DOI":"10.1145\/12130.12156"},{"key":"12_CR13","unstructured":"T. Suel. Nearly optimal deterministic sorting on mesh-connected arrays of processors. In preparation, 1993."}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Computing Theory and Practice"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58078-6_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:16:42Z","timestamp":1605647802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58078-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580782","9783540484356"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-58078-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}