{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:11:48Z","timestamp":1725664308400},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540615507"},{"type":"electronic","value":"9783540705970"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61550-4_176","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:55:25Z","timestamp":1330293325000},"page":"529-541","source":"Crossref","is-referenced-by-count":0,"title":["Routing on triangles, tori and honeycombs"],"prefix":"10.1007","author":[{"given":"Jop F.","family":"Sibeyn","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Kaufmann, M., S. Rajasekaran, J.F. Sibeyn, \u2018Matching the Bisection Bound for Routing and Sorting on the Mesh,\u2019 Proc. 4th Symposium on Parallel Algorithms and Architectures, pp. 31\u201340, ACM, 1992.","DOI":"10.1145\/140901.140905"},{"key":"41_CR2","doi-asserted-by":"crossref","unstructured":"Kaufmann, M., J.F. Sibeyn, \u2018Optimal Multi-Packet Routing on the Torus', Proc. 3rd Scandinavian Workshop on Algorithm Theory, LNCS 621, pp. 118\u2013129, Springer-Verlag, 1992.","DOI":"10.1007\/3-540-55706-7_11"},{"key":"41_CR3","unstructured":"Kaufmann, M., J.F. Sibeyn, T. Suel, \u2018Derandomizing Routing and Sorting Algorithms for Meshes,\u2019 Proc. 5th Symposium on Discrete Algorithms, pp. 669\u2013679, ACMSIAM, 1994."},{"key":"41_CR4","first-page":"272","volume":"726","author":"M. Kunde","year":"1993","unstructured":"Kunde, M., \u2018Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound,\u2019 Proc. European Symp. on Algorithms, LNCS 726, pp. 272\u2013283, 1993.","journal-title":"LNCS"},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"Kunde, M., R. Niedermeier, P. Rossmanith, \u2018Faster Sorting and Routing on Grids with Diagonals,\u2019 Proc. 11th Symposium on Theoretical Aspects of Computer Science, LNCS 775, pp. 225\u2013236, Springer Verlag, 1994.","DOI":"10.1007\/3-540-57785-8_144"},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Kunde, M., T. Tensi, \u2018Multi-Packet Routing on Mesh Connected Processor Arrays,\u2019 Proc. Symposium on Parallel Algorithms and Architectures, pp. 336\u2013343, ACM, 1989.","DOI":"10.1145\/72935.72971"},{"issue":"2","key":"41_CR7","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1006\/jpdc.1995.1064","volume":"26","author":"S. Rajasekaran","year":"1995","unstructured":"Rajasekaran, S., M. Raghavachari, \u2018Optimal Randomized Algorithms for Multipacket and Cut Through Routing on the Mesh', Journal of Parallel and Distributed Computing, 26(2), pp. 257\u2013260, 1995.","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"1","key":"41_CR8","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/7531.7532","volume":"34","author":"J. Reif","year":"1987","unstructured":"Reif, J., L.G. Valiant, \u2018A logarithmic time sort for linear size networks,\u2019 Journal of the ACM, 34(1), pp. 68\u201376, 1987.","journal-title":"Journal of the ACM"},{"key":"41_CR9","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1137\/0214030","volume":"14","author":"R. Reischuk","year":"1985","unstructured":"Reischuk, R., \u2018Probabilistic Parallel Algorithms for Sorting and Selection,\u2019 S1AM Journal of Computing, 14, pp. 396\u2013411, 1985.","journal-title":"S1AM Journal of Computing"},{"key":"41_CR10","volume-title":"Sample Sort on Meshes","author":"J.F. Sibeyn","year":"1995","unstructured":"Sibeyn, J.F., \u2018Sample Sort on Meshes,\u2019 Proc. Computing Science in the Netherlands, SION, Amsterdam, 1995. Full version in Techn. Rep. MPI-I-95-112, Max-Planck Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany, 1995."},{"issue":"8","key":"41_CR11","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L.G. Valiant","year":"1990","unstructured":"Valiant, L.G., \u2018A Bridging Model for Parallel Computation,\u2019 Communications of the ACM, 33(8), pp. 103\u2013111, 1990.","journal-title":"Communications of the ACM"},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Valiant, L.G., G.J. Brebner, \u2018Universal Schemes for Parallel Communication,\u2019 Proc. 13th Symposium on Theory of Computing, pp. 263\u2013277, ACM, 1981.","DOI":"10.1145\/800076.802479"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1996"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61550-4_176.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:07:48Z","timestamp":1605647268000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61550-4_176"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615507","9783540705970"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-61550-4_176","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}