{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:10:18Z","timestamp":1742591418251,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540186250"},{"type":"electronic","value":"9783540480334"}],"license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"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":[[1987]]},"DOI":"10.1007\/3-540-18625-5_53","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:40:13Z","timestamp":1330198813000},"page":"226-241","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["An optimal randomized routing algorithm for the Mesh and a class of efficient Mesh-like routing networks"],"prefix":"10.1007","author":[{"given":"Sanguthevar","family":"Rajasekaran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thanasis","family":"Tsantilas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Lang,H.-W. et al., \u201cSystolic Sorting on a Mesh Connected Network,\u201d IEEE Transactions on Computers, volume c-34, no.7, 1985.","DOI":"10.1109\/TC.1985.1676603"},{"key":"17_CR2","unstructured":"Krizanc,D., Private Communication, 1986."},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Kumar,M., and Hirschberg,D.S., \u201cAn Efficient Implementation of Batcher's Odd-Even Merge Algorithm and its Application in Parallel Sorting Schemes,\u201d IEEE Transactions on Computers, volume c-32, 1983.","DOI":"10.1109\/TC.1983.1676217"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Ma,Y., Sen,S., and Scherson,D., \u201cThe Distance Bound for Sorting on Mesh Connected Processor Arrays is Tight,\u201d Proc. of the IEEE FOCS, 1986.","DOI":"10.1109\/SFCS.1986.54"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Nassimi,D., and Sahni,S., \u201cBitonic Sort on a Mesh Connected Parallel Computer,\u201d IEEE Transactions on Computers, volume c-27, no.1, 1979.","DOI":"10.1145\/322169.322172"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Nassimi,D., and Sahni,S., \u201cData Broadcasting in SIMD Computers,\u201d IEEE Transactions on Computers, volume c-30, no.2, 1981.","DOI":"10.1109\/TC.1981.6312172"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Pippenger,N., \u201cParallel Communication with Limited Buffers,\u201d Proc. IEEE Symposium on FOCS, 1984, pp. 127\u2013136.","DOI":"10.1109\/SFCS.1984.715909"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Sado,K., and Igarishi,Y., \u201cSome Parallel Sorts on a Mesh Connected Processor Array and their Time Efficiency,\u201d to appear in Journal of Parallel and Distributed Computing, 1987.","DOI":"10.1016\/0743-7315(86)90023-7"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Schnorr,C.P., and Shamir,A., \u201cAn Optimal Sorting Algorithm for Mesh Connected Computers,\u201d Proc. of the ACM STOC, 1986.","DOI":"10.1145\/12130.12156"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Thompson,C.D., and Kung,H.T., \u201cSorting on a Mesh Connected Parallel Computer,\u201d Communications of the ACM, volume 20, no.4, 1977.","DOI":"10.1145\/359461.359481"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Thompson,C.D., \u201cThe VLSI Complexity of Sorting,\u201d IEEE Transactions on Computers, volume c-32, no.12, 1983.","DOI":"10.1109\/TC.1983.1676178"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Valiant,L.G., and Brebner,G.J., \u201cUniversal Schemes for Parallel Communication,\u201d Proc. of the ACM STOC, 1981.","DOI":"10.1145\/800076.802479"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18625-5_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T20:39:12Z","timestamp":1742589552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18625-5_53"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540186250","9783540480334"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-18625-5_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]},"assertion":[{"value":"27 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}