{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:29Z","timestamp":1725664709491},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602491"},{"type":"electronic","value":"9783540447702"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60249-6_61","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:58:04Z","timestamp":1330279084000},"page":"293-302","source":"Crossref","is-referenced-by-count":0,"title":["Optimal contiguous expression DAG evaluations"],"prefix":"10.1007","author":[{"given":"Christoph W.","family":"Ke\u00dfler","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Rauber","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"issue":"3","key":"24_CR1","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1145\/321958.321970","volume":"23","author":"A.V. Aho","year":"1976","unstructured":"Aho, A.V., Johnson, S.C.: Optimal Code Generation for Expression Trees, J. ACM 23:3, 1976, 488\u2013501","journal-title":"J. ACM"},{"key":"24_CR2","unstructured":"Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools. Addison-Wesley, 1986"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0096-0551(81)90048-5","volume":"6","author":"G.J. Chaitin","year":"1981","unstructured":"Chaitin, G.J., Auslander M.A., Chandra A.K., Cocke J., Hopkins M.E., Markstein P.W.: Register allocation via coloring. Computer Languages Vol. 6, 47\u201357, 1981","journal-title":"Computer Languages"},{"issue":"6","key":"24_CR4","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/872726.806984","volume":"17","author":"G.J. Chaitin","year":"1982","unstructured":"Chaitin, G.J.: Register allocation & spilling via graph coloring. ACM SIGPLAN Notices 17:6, 201\u20137, 1982","journal-title":"ACM SIGPLAN Notices"},{"key":"24_CR5","unstructured":"The Connection Machine CM-5 Technical Summary, Thinking Machines Corporation, Cambridge, MA, 1991"},{"issue":"3","key":"24_CR6","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1002\/spe.4380090307","volume":"9","author":"J.J. Dongarra","year":"1979","unstructured":"Dongarra, J.J., Jinds, A.R.: Unrolling Loops in Fortran, Software Practice and Experience, 9:3, 219\u201326, 1979","journal-title":"Software Practice and Experience"},{"key":"24_CR7","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1109\/TC.1981.1675827","volume":"C-30","author":"J. Fisher","year":"1981","unstructured":"Fisher, J.,: Trace Scheduling: A Technique for Global Microcode Compaction, IEEE Transactions on Computers, C-30:7, 1981","journal-title":"IEEE Transactions on Computers"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Goodman J.R., Hsu Wei-Chung: Code Scheduling and Register Allocation in Large Basic Blocks, ACM Int. Conf. on Supercomputing, 1988, 442\u201352","DOI":"10.1145\/55364.55407"},{"key":"24_CR9","first-page":"195","volume":"528","author":"C.W. Ke\u00dfler","year":"1991","unstructured":"Ke\u00dfler, C.W., Paul, W.J., Rauber, T.: A Randomized Heuristic Approach to Register Allocation. Proc. of PLILP'91 3rd Int. Symp. on Programming Language Implem. and Logic Programming, Aug. 26\u201328, 1991. Springer LNCS 528, 195\u2013206","journal-title":"Springer LNCS"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Ke\u00dfler, C.W., Paul, W.J., Rauber, T.: Scheduling Vector Straight Line Code on Vector Processors. in: R. Giegerich, S.L. Graham (Ed.): Code Generation\u2014Concepts, Tools, Techniques. Springer Workshops in Computing Series (WICS), 1992","DOI":"10.1007\/978-1-4471-3501-2_5"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K.: Data Structures and Algorithms 2. Springer, 1984","DOI":"10.1007\/978-3-642-69897-2"},{"key":"24_CR12","first-page":"97","volume-title":"An Optimizing Compiler for Vector Processors","author":"T. Rauber","year":"1990","unstructured":"Rauber, T.: An Optimizing Compiler for Vector Processors. Proc. ISMM Int. Conf. on Par. and Distr. Computing and Systems, New York 1990, Acta press, 97\u2013103"},{"key":"24_CR13","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1145\/321607.321620","volume":"17","author":"R. Sethi","year":"1970","unstructured":"Sethi, R., Ullman, J.D.: The generation of optimal code for arithmetic expressions. J. ACM, Vol. 17, 715\u201328, 1970","journal-title":"J. ACM"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1137\/0204020","volume":"4","author":"R. Sethi","year":"1975","unstructured":"Sethi, R.: Complete register allocation problems. SIAM J. Comput. 4, 226\u201348, 1975","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60249-6_61.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:56:42Z","timestamp":1605646602000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60249-6_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602491","9783540447702"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-60249-6_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}