{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:24:08Z","timestamp":1755221048264,"version":"3.43.0"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Telecommunication Systems"],"published-print":{"date-parts":[[2000,5]]},"DOI":"10.1023\/a:1019119401309","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T18:30:27Z","timestamp":1045679427000},"page":"21-27","source":"Crossref","is-referenced-by-count":0,"title":["The Shuffled Mesh: a flexible and efficient model for parallel computing"],"prefix":"10.1007","volume":"13","author":[{"given":"G.","family":"Bongiovanni","sequence":"first","affiliation":[]},{"given":"G.A.","family":"De Biase","sequence":"additional","affiliation":[]},{"given":"A.","family":"Massini","sequence":"additional","affiliation":[]},{"given":"A.","family":"Monti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"329770_CR1","doi-asserted-by":"crossref","unstructured":"S.N. Bhatt, F.R.K. Chung, J.-W. Hong, F.T. Leighton and A.L. Rosemberg, Optimal simulations by butterfly networks, in: Proc. of the 20th Annual ACM Symposium on the Theory of Computing (1988) pp. 192\u2013204.","DOI":"10.1145\/62212.62229"},{"key":"329770_CR2","unstructured":"M. Chan, Dilation 2-embeddings of grids into hypercubes, in: Proc. of the 1988 Internat. Conf. on Parallel Processings (1988) pp. 295\u2013298."},{"key":"329770_CR3","first-page":"601","volume":"53","author":"K.-L. Chung","year":"1991","unstructured":"K.-L. Chung and F.-C. Lin, A cost-optimal parallel algorithm for B-spline surface fitting, Computer Vission, Graphics, and Image Processing 53 (1991) 601\u2013605.","journal-title":"Computer Vission, Graphics, and Image Processing"},{"key":"329770_CR4","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/0743-7315(91)90046-C","volume":"11","author":"K. Efe","year":"1991","unstructured":"K. Efe, Embedding mesh of trees in the hypercube, Journal of Parallel and Distributed Computing 11 (1991) 222\u2013230.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"329770_CR5","doi-asserted-by":"crossref","unstructured":"D. Kleitman, F.T. Leighton, M. Lepley and G.L. Miller, New layouts for shuffle-exchange graph, in: Proc. of the 13th Annual ACM Symposium on the Theory of Computing (1981) pp. 278\u2013292.","DOI":"10.1145\/800076.802480"},{"key":"329770_CR6","doi-asserted-by":"crossref","unstructured":"R. Koch, T. Leighton, B. Maggs, S. Rao and A. Rosenberg, Work-preserving emulations of fixed-connection networks, in: Proc. of the 21th Annual ACM Symposium on the Theory of Computing (1989) pp. 227\u2013240.","DOI":"10.1145\/73007.73029"},{"key":"329770_CR7","doi-asserted-by":"crossref","unstructured":"T. Leighton, New lower bound techniques for VLSI, in: Proc. of the 22th Annual IEEE Symposium on Foundations of Computer Science (1981) pp. 1\u201312.","DOI":"10.1109\/SFCS.1981.22"},{"key":"329770_CR8","doi-asserted-by":"crossref","unstructured":"T. Leighton, B. Maggs and S. Rao, Universal packet routing algorithms, in: Proc. of the 29th Annual IEEE Symposium on Foundations of Computer Science (1988) pp. 256\u2013271.","DOI":"10.1109\/SFCS.1988.21942"},{"key":"329770_CR9","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"T. Leighton","year":"1992","unstructured":"T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes (Morgan Kaufmann, San Mateo, CA, 1992)."},{"key":"329770_CR10","doi-asserted-by":"crossref","unstructured":"F.P. Preparata and J.E. Vuillemin, The cube-connected cycles: A versatile network for parallel computation, in: Proc. of the 12th Annual IEEE Symposium on Foundations of Computer Science (1979) pp. 140\u2013147.","DOI":"10.1109\/SFCS.1979.43"},{"key":"329770_CR11","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/T-C.1971.223205","volume":"20","author":"H.S. Stone","year":"1971","unstructured":"H.S. Stone, Parallel processing with the perfect shuffle, IEEE Transactions on Computers 20 (1971) 153\u2013161.","journal-title":"IEEE Transactions on Computers"},{"key":"329770_CR12","volume-title":"A complexity theory for VLSI","author":"C.D. Thompson","year":"1980","unstructured":"C.D. Thompson, A complexity theory for VLSI, Ph.D. thesis, Carnegie-Mellon University, Pittsburg, PA (1980)."}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019119401309.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1019119401309\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019119401309.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T06:23:51Z","timestamp":1754634231000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1019119401309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["329770"],"URL":"https:\/\/doi.org\/10.1023\/a:1019119401309","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"type":"print","value":"1018-4864"},{"type":"electronic","value":"1572-9451"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}