{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T21:06:11Z","timestamp":1761944771059,"version":"build-2065373602"},"publisher-location":"New York, NY","reference-count":17,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9780387968186"},{"type":"electronic","value":"9780387347707"}],"license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/bfb0040409","type":"book-chapter","created":{"date-parts":[[2006,8,3]],"date-time":"2006-08-03T00:03:50Z","timestamp":1154563430000},"page":"423-433","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":49,"title":["Routing and sorting on mesh-connected arrays"],"prefix":"10.1007","author":[{"given":"Manfred","family":"Kunde","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/MC.1980.1653338","volume":"13","author":"M.J. Foster","year":"1980","unstructured":"Foster, M.J., Kung, H.T.: The design of special-purpose VLSI-chips. IEEE Comput. 13, 26\u201340 (1980)","journal-title":"IEEE Comput."},{"key":"42_CR2","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1109\/TC.1983.1676217","volume":"C-32","author":"M. Kumar","year":"1983","unstructured":"Kumar, M., Hirschberg, D.S.: An efficient implementation of Batcher's odd-even merge algorithm and its application in parallel sorting schemes. IEEE Trans. Comput. C-32, 254\u2013264 (1983)","journal-title":"IEEE Trans. Comput."},{"key":"42_CR3","first-page":"84","volume-title":"Lect. Notes Comput. Sci., vol. 237","author":"M. Kunde","year":"1986","unstructured":"Kunde, M.: A general approach to sorting on 3-dimensionally mesh-connected arrays. In: H\u00e4ndlers, W. (eds.) Lect. Notes Comput. Sci., vol. 237, pp. 84\u201395. Berlin-Heidelberg-New York-Tokyo: Springer 1986"},{"key":"42_CR4","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF00264359","volume":"24","author":"M. Kunde","year":"1987","unstructured":"Kunde, M.: Lower bounds for sorting on mesh-connected architectures. Acta Informatica 24, 121\u2013130 (1987).","journal-title":"Acta Informatica"},{"key":"42_CR5","first-page":"408","volume-title":"Lect. Notes Comp. Sci., vol. 247","author":"M. Kunde","year":"1987","unstructured":"Kunde, M.: Optimal sorting on multi-dimensionally mesh-connected computers. Proceedings of STACS 87. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds.) Lect. Notes Comp. Sci., vol. 247, pp. 408\u2013419. Berlin-Heidelberg-New York-Tokyo: Springer 1987"},{"key":"42_CR6","unstructured":"Kunde, M.: Bounds for l-section and related problems on grids of processors; submitted"},{"key":"42_CR7","unstructured":"Kung, H.T., Leiserson, C.E.: Systolic arrays for VLSI. Symposium on Sparse Matrix Computation 1978, Proceeding, Duff, I.S., Stewart, C.G. (eds.) 1978"},{"key":"42_CR8","first-page":"224","volume-title":"The art of computer programming, vol. 3: Sorting and Searching","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The art of computer programming, vol. 3: Sorting and Searching, Addison Wesley, Reading, 1973, pp. 224\u2013225."},{"key":"42_CR9","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1109\/TC.1985.1676603","volume":"C-34","author":"H.-W. Lang","year":"1985","unstructured":"Lang, H.-W., Schimmler, M., Schmeck, H., Schr\u00f6der, H.: Systolic sorting on a mesh-connected network. IEEE Trans. Comput. C-34, 652\u2013658 (1985)","journal-title":"IEEE Trans. Comput."},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"Ma, Y., Sen, S., Scherson, I.D.: The distance bound for sorting on mesh-connected processor arrays is tight. Proceedings FOCS 86, pp. 255\u2013263","DOI":"10.1109\/SFCS.1986.54"},{"key":"42_CR11","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TC.1979.1675216","volume":"C-28","author":"D. Nassimi","year":"1979","unstructured":"Nassimi, D., Sahni, S.: Bitonic sort on a mesh-connected parallel computer. IEEE Trans. Comput. C-28, 2\u20137 (1979)","journal-title":"IEEE Trans. Comput."},{"key":"42_CR12","unstructured":"Rajasekaran, S., Tsantilas, Th.: An optimal randomized routing algorithm for the mesh and a class of efficient mesh-like routing networks. 7th Conference on Foundations of Software Technology and Theoretical Science, Pune, India"},{"key":"42_CR13","series-title":"Technical Report","volume-title":"A fast parallel pseudo-merge sort algorithm","author":"K. Sado","year":"1985","unstructured":"Sado, K., Igarashi, Z.: A fast parallel pseudo-merge sort algorithm. Gunma University, Technical Report, Japan, 1985"},{"key":"42_CR14","series-title":"Technical Report","volume-title":"Fast sorting on a three dimensional cube grid","author":"M. Schimmler","year":"1986","unstructured":"Schimmler, M.: Fast sorting on a three dimensional cube grid. Technical Report 8604, University of Kiel, Germany, 1986"},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"Schnorr, C.P., Shamir, A.: An optimal sorting algorithm for mesh-connected computers, pp. 255\u2013263. Proceedings STOC 1986. Berkley 1986","DOI":"10.1145\/12130.12156"},{"key":"42_CR16","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1145\/359461.359481","volume":"20","author":"C.D. Thompson","year":"1977","unstructured":"Thompson, C.D., Kung, H.T.: Sorting on a mesh-connected parallel computer. CACM 20, 263\u2013271 (1977)","journal-title":"CACM"},{"key":"42_CR17","doi-asserted-by":"crossref","unstructured":"Valiant, L.G., Brebner, G.J.: Universal schemes for parallel communication. Proceedings STOC 81, pp. 263\u2013277.","DOI":"10.1145\/800076.802479"}],"container-title":["Lecture Notes in Computer Science","VLSI Algorithms and Architectures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0040409","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T09:17:26Z","timestamp":1736500646000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0040409"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9780387968186","9780387347707"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0040409","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}