{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:24Z","timestamp":1725663624822},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540572732"},{"type":"electronic","value":"9783540480327"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57273-2_68","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:37:03Z","timestamp":1330259823000},"page":"333-344","source":"Crossref","is-referenced-by-count":8,"title":["Randomized routing on meshes with buses"],"prefix":"10.1007","author":[{"given":"Jop F.","family":"Sibeyn","sequence":"first","affiliation":[]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[]},{"given":"Rajeev","family":"Raman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","volume":"18","author":"D. Angluin","year":"1979","unstructured":"D. Angluin and L. G. Valiant. Fast probabilistic algorithms for Hamiltonian circuits and matchings. J. Comput. Sys. Sc., 18 (1979), pp. 155\u2013193.","journal-title":"J. Comput. Sys. Sc."},{"key":"30_CR2","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1109\/TC.1984.1676405","volume":"33","author":"S. H. Bokhari","year":"1984","unstructured":"S. H. Bokhari, Finding maximum on an array processor with a global bus, IEEE Trans. Comput., 33 (1984), pp. 133\u2013139.","journal-title":"IEEE Trans. Comput."},{"key":"30_CR3","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0020-0190(93)90208-Q","volume":"45","author":"S. Cheung","year":"1993","unstructured":"S. Cheung and F. C. M. Lau, A lower bound for permutation routing on two-dimensional bused meshes, IPL, 45 (1993), pp. 225\u2013228.","journal-title":"IPL"},{"key":"30_CR4","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1145\/322047.322057","volume":"25","author":"W. M. Gentleman","year":"1978","unstructured":"W. M. Gentleman, Some complexity results for matrix computations on parallel processors, J. ACM, 25 (1978), pp. 112\u2013115.","journal-title":"J. ACM"},{"key":"30_CR5","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. 4th ACM SPAA (1992), pp. 31\u201340.","DOI":"10.1145\/140901.140905"},{"key":"30_CR6","first-page":"118","volume":"621","author":"M. Kaufmann","year":"1992","unstructured":"M. Kaufmann and J. F. Sibeyn, Optimal multi-packet routing on the torus, In Proc. 3rd Scandinavian Workshop on Algorithm Theory (1992), LNCS 621, pp. 118\u2013129.","journal-title":"LNCS"},{"key":"30_CR7","first-page":"423","volume":"319","author":"M. Kunde","year":"1988","unstructured":"M. Kunde, Routing and sorting on mesh connected processor arrays, in Proc. 3rd Aegean Workshop on Computing (1988), LNCS 319, pp. 423\u2013433.","journal-title":"LNCS"},{"key":"30_CR8","unstructured":"M. Kunde and T. Tensi, Multi-packet routing on mesh connected processor arrays, in Proc. 2nd ACM SPAA (1989), pp. 336\u2013343."},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"F. T. Leighton, F. Makedon, I. G. Tollis, A 2n-2 step algorithm for routing in an n \u00d7 n array with constant size queues, in Proc. 2nd ACM SPAA (1989), pp. 328\u2013335.","DOI":"10.1145\/72935.72970"},{"key":"30_CR10","unstructured":"J. Leung and S. M. Shende, On multi-dimensional packet routing for meshes with buses, in Proc. 3rd IEEE SPDP (1991), pp. 834\u2013837. J. Parl. Dist. Comp., to appear."},{"key":"30_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 routing algorithms for mesh-connected processor arrays, Algorithmica, 8 (1992), pp. 21\u201338.","journal-title":"Algorithmica"},{"key":"30_CR12","unstructured":"J. F. Sibeyn and M. Kaufmann, k-k sorting on meshes, manuscript, 1992."},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"L. G. Valiant and G. J. Brebner, Universal schemes for parallel communication, in Proc. 13th ACM STOC (1981), pp. 263\u2013277.","DOI":"10.1145\/800076.802479"}],"container-title":["Lecture Notes in Computer Science","Algorithms\u2014ESA '93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57273-2_68.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:02:29Z","timestamp":1619571749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57273-2_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540572732","9783540480327"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-57273-2_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}