{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:30:49Z","timestamp":1743154249974,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540646822"},{"type":"electronic","value":"9783540691068"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054376","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T07:43:28Z","timestamp":1149666208000},"page":"288-299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Solving fundamental problems on sparse-meshes"],"prefix":"10.1007","author":[{"given":"Jop F.","family":"Sibeyn","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,26]]},"reference":[{"issue":"4","key":"27_CR1","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF02090401","volume":"24","author":"M. Baumslag","year":"1991","unstructured":"Baumslag, M., F. Annexstein, \u2018A Unified Framework for Off-Line Permutation Routing in Parallel Networks,\u2019 Mathematical Systems Theory, 24(4), pp. 233\u2013251, 1991.","journal-title":"Mathematical Systems Theory"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Chlebus, B.S., A. Czumaj, L. Gasieniec, M. Kowaluk, W. Plandowski, \u2018Parallel Alternating-Direction Access Machine,\u2019 Proc. 21st Mathematical Foundations of Computer Science, LNCS. 1113, pp. 267\u2013278, Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61550-4_154"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Chlebus, B.S., A. Czumaj, J.F. Sibeyn, \u2018Routing on the PADAM: Degrees of Optimality,\u2019 Proc. 3rd Euro-Par Conference, LNCS. 1300, pp. 272\u2013279, Springer-Verlag, 1997.","DOI":"10.1007\/BFb0002744"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1137\/0211043","volume":"11","author":"R. Cole","year":"1982","unstructured":"Cole, R., J. Hopcroft, \u2018On Edge Coloring Bipartite Graphs,\u2019 SIAM Journal on Computing, 11, p. 540\u2013546, 1982.","journal-title":"SIAM Journal on Computing"},{"key":"27_CR5","unstructured":"J\u00e1J\u00e1, J., An Introduction to Parallel Algorithms, Addison-Wesley Publishing Company, Inc., 992."},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Juurlink, B., P.S. Rao, J.F. Sibeyn, \u2018Worm-Hole Gossiping on Meshes and Tori,\u2019 Proc. 2nd uro-Par Conference, LNCS 1123, pp. 361\u201369, Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61626-8_47"},{"key":"27_CR7","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/BF02523190","volume":"17","author":"M. Kaufmann","year":"1997","unstructured":"Kaufmann, M., J.F. Sibeyn, \u2018Randomized Multipacket Routing and Sorting on Meshes,\u2019 Algorithmica, 17, pp. 224\u2013244, 1997.","journal-title":"Algorithmica"},{"key":"27_CR8","unstructured":"Kaufmann, M., J.F. Sibeyn, T. Suel, \u2018Derandomizing Algorithms for Routing and Sorting on eshes,\u2019 Proc. 5th Symposium on Discrete Algorithms, pp. 669\u201379, ACM-SIAM, 1994."},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Kunde, M., \u2018Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match he Bisection Bound,\u2019 Proc. European Symposium on Algorithms, LNCS 726, pp. 272\u201383, pringer-Verlag, 1993.","DOI":"10.1007\/3-540-57273-2_62"},{"key":"27_CR10","first-page":"51","volume":"2","author":"V. Lepp\u00c4nen","year":"1995","unstructured":"Lepp\u00c4nen V., M. Penttonen, \u2018Work-Optimal Simulation of PRAM Models on Meshes,\u2019 Nordic ournal of Computing, 2, pp. 51\u201369, 1995.","journal-title":"Nordic ournal of Computing"},{"issue":"2","key":"27_CR11","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TC.1981.6312171","volume":"30","author":"G. Lev","year":"1981","unstructured":"Lev, G., N. Pippenger, L.G. Valiant, \u2018A Fast Parallel Algorithm for Routing in Permutation Networks,\u2019 IEEE Transactions on Computers, 30(2) pp. 93\u2013100, 1981.","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"27_CR12","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1006\/jagm.1995.1042","volume":"19","author":"S. Rajasekaran","year":"1995","unstructured":"Rajasekaran, S., \u2018k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh,\u2019 Journal of Algorithms, 19(3), pp. 361\u2013382, 1995.","journal-title":"Journal of Algorithms"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Sibeyn, J.F., \u2018List Ranking on Interconnection Networks,\u2019 Proc. 2nd Euro-Par Conference, LNCS 1123, pp. 799\u2013808, Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61626-8_104"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Sibeyn, J.F., \u2018Better Trade-offs for Parallel List Ranking,\u2019 Proc. 9th Symposium on Parallel Algorithms and Architectures, pp. 221\u2013230, ACM, 1997.","DOI":"10.1145\/258492.258514"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Sibeyn, J.F., 'sample Sort on Meshes,\u2019 Proc. 3rd Euro-Par Conference, LNCS 1300, pp. 389\u2013398, Springer-Verlag, 1997.","DOI":"10.1007\/BFb0002762"},{"key":"27_CR16","volume-title":"Techn. Rep. MPI-I-97-1021","author":"J.F. Sibeyn","year":"1997","unstructured":"Sibeyn, J.F., \u2018From Parallel to External List Ranking,\u2019 Techn. Rep. MPI-I-97-1021, Max-Planck Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany, 1997."},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Sibeyn, J.F., F. Guillaume, T. Seidel, \u2018Practical Parallel List Ranking,\u2019 Proc. 4th Symposium on Solving Irregularly Structured Problems in Parallel, LNCS 1253, pp. 25\u201336, Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63138-0_3"},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1142\/S0129626495000072","volume":"5","author":"T. Suel","year":"1995","unstructured":"T. Suel, Permutation Routing and Sorting on Meshes with Row and Column Buses, Parallel Processing Letters, 5, pp. 63\u201380, 1995.","journal-title":"Parallel Processing Letters"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Thompson, CD., \u2018Area-Time Complexity for VLSI,\u2019 Proc. 11th Symposium on Theory of Computing, pp. 81\u201388, ACM, 1979.","DOI":"10.1145\/800135.804401"},{"key":"27_CR20","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","Algorithm Theory \u2014 SWAT'98"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054376","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T19:17:56Z","timestamp":1676575076000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0054376"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646822","9783540691068"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0054376","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"26 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}