{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T09:07:22Z","timestamp":1648544842294},"reference-count":15,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1016\/s0167-739x(02)00035-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:33:33Z","timestamp":1027593213000},"page":"699-708","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing register spills for eager functional languages"],"prefix":"10.1016","volume":"18","author":[{"given":"S.","family":"Mishra","sequence":"first","affiliation":[]},{"given":"K.","family":"Sikdar","sequence":"additional","affiliation":[]},{"given":"M.","family":"Satpathy","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-739X(02)00035-3_BIB1","doi-asserted-by":"crossref","unstructured":"G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi, Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties, Springer, Berlin, 1999.","DOI":"10.1007\/978-3-642-58412-1"},{"issue":"1","key":"10.1016\/S0167-739X(02)00035-3_BIB2","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1145\/321992.322001","article-title":"Code generation for expressions with common subexpressions","volume":"24","author":"Aho","year":"1977","journal-title":"JACM"},{"key":"10.1016\/S0167-739X(02)00035-3_BIB3","unstructured":"A.V. Aho, R. Sethi, J.D. Ullman, Compilers: Principles, Techniques and Tools, Addison-Wesley, Reading, MA, 1986."},{"key":"10.1016\/S0167-739X(02)00035-3_BIB4","unstructured":"R. Bird, P. Wadler, Introduction to Functional Programming, Prentice-Hall, Englewood Cliffs, NJ, 1988."},{"issue":"2","key":"10.1016\/S0167-739X(02)00035-3_BIB5","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1109\/32.121752","article-title":"Subprogram inlining: a study of its effect on program execution time","volume":"18","author":"Davidson","year":"1992","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0167-739X(02)00035-3_BIB6","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979."},{"key":"10.1016\/S0167-739X(02)00035-3_BIB7","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/BF01582009","article-title":"On the acyclic subgraph polytope","volume":"33","author":"Grotschel","year":"1985","journal-title":"Math. Program."},{"key":"10.1016\/S0167-739X(02)00035-3_BIB8","unstructured":"J.L. Hennessy, D.A. Patterson, Computer Architecture: A Quantitative Approach, 2nd Edition, Morgan Kaufmann, Los Altos, CA, 1996."},{"key":"10.1016\/S0167-739X(02)00035-3_BIB9","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(94)00086-7","article-title":"Approximations for the maximum acyclic subgraph problem","volume":"51","author":"Hassin","year":"1994","journal-title":"IPL"},{"key":"10.1016\/S0167-739X(02)00035-3_BIB10","doi-asserted-by":"crossref","unstructured":"F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.","DOI":"10.21236\/AD0705364"},{"key":"10.1016\/S0167-739X(02)00035-3_BIB11","doi-asserted-by":"crossref","unstructured":"S. Mishra, K. Sikdar, On approximability of linear ordering and related NP-optimization problems on graphs, in: H. Broersma, U. Faigle, J. Hurink, S. Pickl (Eds.), Electronic Notes in Discrete Mathematics, Elsevier, Amsterdam, 2001 (Extended Abstract).","DOI":"10.1016\/S1571-0653(05)80081-2"},{"key":"10.1016\/S0167-739X(02)00035-3_BIB12","unstructured":"M. Satpathy, A. Sanyal, G. Venkatesh, Improved register usage of functional programs through multiple function versions, J. Funct. Logic Program. 7 (1998) 1\u201346."},{"key":"10.1016\/S0167-739X(02)00035-3_BIB13","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization, approximation, and complexity classes","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/S0167-739X(02)00035-3_BIB14","doi-asserted-by":"crossref","unstructured":"L.C. Paulson, ML for the Working Programmer, Cambridge University Press, Cambridge, 1996.","DOI":"10.1017\/CBO9780511811326"},{"key":"10.1016\/S0167-739X(02)00035-3_BIB15","unstructured":"S.L. Peyton Jones, Implementation of Functional Programming Languages, Prentice-Hall, Englewood Cliffs, NJ, 1987."}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X02000353?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X02000353?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T03:26:55Z","timestamp":1578454015000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X02000353"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0167739X02000353"],"URL":"https:\/\/doi.org\/10.1016\/s0167-739x(02)00035-3","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}