{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:25:52Z","timestamp":1757629552373,"version":"3.44.0"},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,9,1]],"date-time":"1991-09-01T00:00:00Z","timestamp":683683200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,9,1]],"date-time":"1991-09-01T00:00:00Z","timestamp":683683200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1991,9]]},"DOI":"10.1016\/0743-7315(91)90109-m","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"58-64","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":24,"title":["Optimal expression evaluation for data parallel architectures"],"prefix":"10.1016","volume":"13","author":[{"given":"John R.","family":"Gilbert","sequence":"first","affiliation":[]},{"given":"Robert","family":"Schreiber","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(91)90109-M_BIB1","series-title":"Proc. ACM\/SIGPLAN PPEALS, Symposium on Parallel Programming Experience with Applications, Languages, and Systems","article-title":"Compiling Fortran 8x array features for the Connection Machine computer system","author":"Albert","year":"1988"},{"key":"10.1016\/0743-7315(91)90109-M_BIB2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.2307\/2412028","article-title":"Methods for computing Wagner trees","volume":"19","author":"Farris","year":"1970","journal-title":"Systematic Zoology"},{"key":"10.1016\/0743-7315(91)90109-M_BIB3","doi-asserted-by":"crossref","first-page":"406","DOI":"10.2307\/2412116","article-title":"Toward defining the course of evolution: Minimum change for a specific tree topology","volume":"20","author":"Fitch","year":"1971","journal-title":"Systematic Zoology"},{"year":"1979","author":"Garcy","key":"10.1016\/0743-7315(91)90109-M_BIB4"},{"key":"10.1016\/0743-7315(91)90109-M_BIB5","unstructured":"Gilbert, J. R., and Schreiber, R. Optimal data allocation for the execution of basic blocks on data parallel architectures, in preparation."},{"key":"10.1016\/0743-7315(91)90109-M_BIB6","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/2529676","article-title":"Minimum mutation fits to a given tree","volume":"29","author":"Hartigan","year":"1973","journal-title":"Biometrics"},{"key":"10.1016\/0743-7315(91)90109-M_BIB7","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0167-6377(86)90008-8","article-title":"A linear time algorithm for full Steiner trees","volume":"4","author":"Hwang","year":"1986","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0743-7315(91)90109-M_BIB8","series-title":"Proc. Frontiers '88: The Second Symposium on the Frontiers of Massively Parallel Computation","article-title":"Massively parallel data optimization","author":"Knobe","year":"1988"},{"key":"10.1016\/0743-7315(91)90109-M_BIB9","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/0743-7315(90)90086-5","article-title":"Data optimization: Allocation of arrays to reduce communication on SIMD machines","volume":"8","author":"Knobe","year":"1990","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/0743-7315(91)90109-M_BIB10","series-title":"Proc. Frontiers '90: The Third Symposium on the Frontiers of Massively Parallel Computation","article-title":"Index domain alignment: Minimizing cost of crossreferencing between distributed arrays","author":"Li","year":"1990"},{"key":"10.1016\/0743-7315(91)90109-M_BIB11","doi-asserted-by":"crossref","first-page":"143","DOI":"10.4153\/CMB-1961-016-2","article-title":"On the problem of Steiner","volume":"4","author":"Melzak","year":"1961","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0743-7315(91)90109-M_BIB12","series-title":"Proc. Frontiers '90:: The Third Symposium on the Frontiers of Massively Parallel Computation","article-title":"A framework for efficient execution of array-based languages on SIMD computers","author":"Prins","year":"1990"},{"key":"10.1016\/0743-7315(91)90109-M_BIB13","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1137\/0128004","article-title":"Minimal mutation trees of sequences","volume":"28","author":"Sankoff","year":"1975","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0743-7315(91)90109-M_BIB14","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230170203","article-title":"Steiner problem in networks: A survey","volume":"17","author":"Winter","year":"1987","journal-title":"Networks"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159190109M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159190109M?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:29:33Z","timestamp":1757514573000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159190109M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,9]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,9]]}},"alternative-id":["074373159190109M"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(91)90109-m","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1991,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimal expression evaluation for data parallel architectures","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(91)90109-M","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1991 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}