{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T18:20:59Z","timestamp":1649182859808},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1996,4]]},"DOI":"10.1007\/bf01961545","type":"journal-article","created":{"date-parts":[[2005,7,29]],"date-time":"2005-07-29T16:13:26Z","timestamp":1122653606000},"page":"373-396","source":"Crossref","is-referenced-by-count":0,"title":["Scheduling tree dags on parallel architectures"],"prefix":"10.1007","volume":"15","author":[{"given":"K.","family":"Kalpakis","sequence":"first","affiliation":[]},{"given":"Y.","family":"Yesha","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01961545_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(90)90188-N","volume":"71","author":"A. Aggarwal","year":"1990","unstructured":"A. Aggarwal, A. K. Chandra, and M. Snir. Communication complexity of PRAMs.Theoretical Computer Science,71 (1990), 3\u201328.","journal-title":"Theoretical Computer Science"},{"key":"BF01961545_CR2","doi-asserted-by":"crossref","unstructured":"S. Bhatt, F. Chung, T. Leighton, and A. Rosenberg. Optimal simulations of tree machines.Proc. 27th Annual Symposium on Foundations of Computer Science, 1986, pp. 274\u2013282.","DOI":"10.1109\/SFCS.1986.38"},{"issue":"4","key":"BF01961545_CR3","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1137\/0214055","volume":"14","author":"G. Frederickson","year":"1985","unstructured":"G. Frederickson. Updating of minimum spanning trees, with applications.SIAM Journal on Computing,14(4) (1985), 781\u2013798.","journal-title":"SIAM Journal on Computing"},{"key":"BF01961545_CR4","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson.Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979."},{"key":"BF01961545_CR5","first-page":"629","volume":"I","author":"D. Ghosal","year":"1991","unstructured":"D. Ghosal, A. Mukherjee, R. Thurimella, and Y. Yesha. Mapping task trees onto a linear array.Proc. 1991International Conference on Parallel Processing, Vol. I, 1991, pp. 629\u2013633.","journal-title":"Proc. 1991 International Conference on Parallel Processing"},{"key":"BF01961545_CR6","unstructured":"D. Ghosal, A. Mukherjee, R. Thurimella, and Y. Yesha. Scheduling task-trees onto a linear array. Manuscript, 1992."},{"key":"BF01961545_CR7","doi-asserted-by":"crossref","unstructured":"H. Jung, L. Kirousis, and P. Spirakis. Lower bounds and efficient algorithms for multiprocessor scheduling of dags with communication delays.Proc. ACM Symposium on Parallel Algorithms and Architectures, 1989, pp. 254\u2013264.","DOI":"10.1145\/72935.72962"},{"key":"BF01961545_CR8","volume-title":"UMIACS-TR-92-75 CS-TR-2924","author":"K. Kalpakis","year":"1992","unstructured":"K. Kalpakis and Y. Yesha. On the Power of the Linear Array Architecture for Performing Tree-Structured Computations. UMIACS-TR-92-75 CS-TR-2924, University of Maryland at College Park, Institute for Advanced Computer Studies, July 1992."},{"key":"BF01961545_CR9","volume-title":"UMIACS-TR-92-110.1 CS-TR-2974.1","author":"K. Kalpakis","year":"1992","unstructured":"K. Kalpakis and Y. Yesha. Optimal Within a Constant Schedules for Forest Dags on Parallel Architectures. UMIACS-TR-92-110.1 CS-TR-2974.1, University of Maryland at College Park, Institute for Advanced Computer Studies, October 1992."},{"key":"BF01961545_CR10","doi-asserted-by":"crossref","unstructured":"S. R. Kosaraju. Parallel evaluation of division-free arithmetic expressions.Proc. 18th Annual ACM Symposium on Theory of Computing, 1986, pp. 231\u2013239.","DOI":"10.1145\/12130.12153"},{"issue":"4","key":"BF01961545_CR11","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1137\/0216044","volume":"16","author":"C. H. Papadimitriou","year":"1987","unstructured":"C. H. Papadimitriou and J. D. Ullman. A communication-time tradeoff.SIAM Journal on Computing,16(4) (1987), 639\u2013646.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"BF01961545_CR12","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1137\/0219021","volume":"19","author":"C. H. Papadimitriou","year":"1990","unstructured":"C. H. Papadimitriou and M. Yannakakis. Towards an architecture-independent analysis of parallel algorithms.SIAM Journal on Computing,19(2) (1990), 322\u2013328.","journal-title":"SIAM Journal on Computing"},{"key":"BF01961545_CR13","first-page":"229","volume":"III","author":"R. Thurimella","year":"1992","unstructured":"R. Thurimella and Y. Yesha. A scheduling principle for precedence graphs with communication delay.Proc. 1992International Conference on Parallel Processing, Vol. III, 1992, pp. 229\u2013236.","journal-title":"Proc. 1992 International Conference on Parallel Processing"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01961545.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01961545\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01961545","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T12:04:49Z","timestamp":1586347489000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01961545"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["BF01961545"],"URL":"https:\/\/doi.org\/10.1007\/bf01961545","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,4]]}}}