{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:24:52Z","timestamp":1729661092058,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/hpcsim.2016.7568329","type":"proceedings-article","created":{"date-parts":[[2016,9,15]],"date-time":"2016-09-15T16:53:29Z","timestamp":1473958409000},"page":"148-155","source":"Crossref","is-referenced-by-count":2,"title":["Scheduling binary tree-shaped task graphs representing optimal parenthesizations of dense-triangular matrix chain product"],"prefix":"10.1109","author":[{"given":"Khaoula","family":"Bezzina","sequence":"first","affiliation":[]},{"given":"Zaher","family":"Mahjoub","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/0402016"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/0402042"},{"key":"ref12","first-page":"220","article-title":"Maximal and optimal degrees of parallelism for a parallel algorithm","author":"mahjoub","year":"1994","journal-title":"Transputer 94"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.55"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2779052"},{"key":"ref15","article-title":"Algorithmes et architectures parallèles","author":"cosnard","year":"1993","journal-title":"InterEditions"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1362-8"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1051\/ro\/1993270302731","article-title":"Un algorithme parallèle optimal pour la résolution d'un système triangulaire","volume":"27","author":"marrakchi","year":"1993","journal-title":"RAIRO - Operations Research"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01573178"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512551"},{"key":"ref6","first-page":"19","article-title":"On greedy algorithms for solving the matrix chain product problem with square dense and triangular matrices","author":"bezzina","year":"2014","journal-title":"International Conference on Automation Control Engineering and Computer Science"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/69610.357992"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2003.1195411"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/2011100"},{"article-title":"Algebraic list-decoding of error-correcting codes","year":"2007","author":"parvaresh","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365424"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1051\/ro:2000101"}],"event":{"name":"2016 International Conference on High Performance Computing & Simulation (HPCS)","start":{"date-parts":[[2016,7,18]]},"location":"Innsbruck, Austria","end":{"date-parts":[[2016,7,22]]}},"container-title":["2016 International Conference on High Performance Computing & Simulation (HPCS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7562293\/7568299\/07568329.pdf?arnumber=7568329","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T11:12:56Z","timestamp":1568373176000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7568329\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/hpcsim.2016.7568329","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}