{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T11:44:27Z","timestamp":1648899867610},"reference-count":18,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,8,1]],"date-time":"1995-08-01T00:00:00Z","timestamp":807235200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6560,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1995,8]]},"DOI":"10.1016\/0304-3975(94)00267-m","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T10:09:04Z","timestamp":1051265344000},"page":"1-18","source":"Crossref","is-referenced-by-count":2,"title":["Optimal parallel execution of complete binary trees and grids into most popular interconnection networks"],"prefix":"10.1016","volume":"147","author":[{"given":"E.","family":"Bampis","sequence":"first","affiliation":[]},{"given":"J.-C.","family":"K\u00f6nig","sequence":"additional","affiliation":[]},{"given":"D.","family":"Trystram","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00267-M_BIB1_1","author":"Anderson","year":"1989","journal-title":"Low overhead parallel schedules for task graphs, Tech. Report Univ. of Washington"},{"key":"10.1016\/0304-3975(94)00267-M_BIB1_2","series-title":"Proc. SPAA","author":"Anderson","year":"1990"},{"issue":"4","key":"10.1016\/0304-3975(94)00267-M_BIB2","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1142\/S0129626492000519","article-title":"A low overhead schedule for a 3D-grid graph","volume":"2","author":"Bampis","year":"1992","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/0304-3975(94)00267-M_BIB3","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1109\/TC.1981.1675756","article-title":"On the mapping problem","volume":"C-30","author":"Bokhari","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(94)00267-M_BIB4","series-title":"Operating Systems Theory","author":"Coffman","year":"1972"},{"key":"10.1016\/0304-3975(94)00267-M_BIB5","series-title":"Parallel Computing '91","first-page":"3","article-title":"Designing parallel non numerical algorithms","author":"Cosnard","year":"1991"},{"key":"10.1016\/0304-3975(94)00267-M_BIB6","unstructured":"Parallel Process. Lett. 1 (1)."},{"key":"10.1016\/0304-3975(94)00267-M_BIB7","first-page":"758","article-title":"A combinatorial problem","volume":"49","author":"De Bruijn","year":"1946"},{"key":"10.1016\/0304-3975(94)00267-M_BIB8","series-title":"collection ERI","article-title":"Communications dans les r\u00e9seaux de processeurs","author":"De Rumeur","year":"1994"},{"key":"10.1016\/0304-3975(94)00267-M_BIB9","series-title":"Efficient Parallel Algorithms","author":"Gibbons","year":"1988"},{"key":"10.1016\/0304-3975(94)00267-M_BIB10","first-page":"869","article-title":"A survey of parallel algorithms for shared memory machines","volume":"Vol. A","author":"Karp","year":"1992"},{"key":"10.1016\/0304-3975(94)00267-M_BIB11","unstructured":"S. R. Kosaraju and A.L. Delcher, Optimal parallel evaluation of tree-structured computations by ranking, Lecture Notes in Computer Science, Vol. 319 (Springer, Berlin); VLSI Algorithms Architectures 103\u2013110."},{"key":"10.1016\/0304-3975(94)00267-M_BIB12","series-title":"Proc. Aegean Workshop on Computing","first-page":"236","article-title":"Efficient parallel evaluation of straight-line code and arithmetic circiuts","volume":"Vol. 227","author":"Miller","year":"1986"},{"key":"10.1016\/0304-3975(94)00267-M_BIB13","series-title":"Proc. SPAA","first-page":"257","article-title":"Dense-edges embedding of binary trees in the mesh","author":"Gibbons","year":"1992"},{"key":"10.1016\/0304-3975(94)00267-M_BIB14","series-title":"Proc. 13th ACM Symp. on the Theory of Comp.","first-page":"293","article-title":"Bounds on minimax edge length for complete binary trees","author":"Paterson","year":"1981"},{"issue":"4","key":"10.1016\/0304-3975(94)00267-M_BIB15","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1137\/0216044","article-title":"A communciation time tradeoff","volume":"16","author":"Papadimitriou","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)00267-M_BIB16","series-title":"VLSI Systems and Computations","first-page":"119","article-title":"Minimum edge length planar embeddings of trees","author":"Ruzzo","year":"1981"},{"key":"10.1016\/0304-3975(94)00267-M_BIB17","author":"Saad","year":"1984"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400267M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400267M?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:50:10Z","timestamp":1555419010000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759400267M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,8]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,8]]}},"alternative-id":["030439759400267M"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00267-m","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,8]]}}}