{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T09:40:17Z","timestamp":1759138817420,"version":"3.44.0"},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,11,1]],"date-time":"1998-11-01T00:00:00Z","timestamp":909878400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,11,1]],"date-time":"1998-11-01T00:00:00Z","timestamp":909878400000},"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":["Integration"],"published-print":{"date-parts":[[1998,11]]},"DOI":"10.1016\/s0167-9260(98)00008-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T08:27:58Z","timestamp":1027585678000},"page":"89-102","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["An approximation algorithm for the register allocation problem"],"prefix":"10.1016","volume":"25","author":[{"given":"K.","family":"Jansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Reiter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-9260(98)00008-X_BIB1","unstructured":"M.C. MacFarland, A.C. Parker, R. Camposano, Tutorial on high-level synthesis, 25th Design Automation Conf., 1988, pp. 330\u2013336."},{"year":"1977","series-title":"Flow Analysis of Computer Programs","author":"Hecht","key":"10.1016\/S0167-9260(98)00008-X_BIB2"},{"year":"1992","series-title":"High-Level Synthesis","author":"Camposano","key":"10.1016\/S0167-9260(98)00008-X_BIB3"},{"year":"1992","series-title":"High-Level Synthesis: Introduction to Chip and System Design","author":"Gajski","key":"10.1016\/S0167-9260(98)00008-X_BIB4"},{"year":"1992","series-title":"The Synthesis Approach to Digital System Design","author":"Michel","key":"10.1016\/S0167-9260(98)00008-X_BIB5"},{"year":"1988","series-title":"Compilers Principles, Techniques and Tools","author":"Aho","key":"10.1016\/S0167-9260(98)00008-X_BIB6"},{"key":"10.1016\/S0167-9260(98)00008-X_BIB7","doi-asserted-by":"crossref","unstructured":"G.J. Chaitin, Register allocation and spilling via graph coloring, Symp. on Compiler Construction, 1982, pp. 98\u2013101.","DOI":"10.1145\/800230.806984"},{"key":"10.1016\/S0167-9260(98)00008-X_BIB8","first-page":"241","volume":"17","author":"Jansen","year":"1994","journal-title":"On the complexity of allocation problems in high level synthesis, Integration \u2013 the VLSI J."},{"key":"10.1016\/S0167-9260(98)00008-X_BIB9","doi-asserted-by":"crossref","unstructured":"C.Y. Huang, Y.S. Chen, Y.L. Lin, Y.C. Hsu, Data path allocation based on bipartite weighted matching, 27th Design Automation Conf., 1990, 499\u2013503.","DOI":"10.1145\/123186.123350"},{"key":"10.1016\/S0167-9260(98)00008-X_BIB10","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1016\/0165-6074(87)90093-7","article-title":"Automated datapath synthesis: a compilation approach","volume":"21","author":"Pfahler","year":"1987","journal-title":"Microprocess. Microprogramming"},{"key":"10.1016\/S0167-9260(98)00008-X_BIB11","doi-asserted-by":"crossref","unstructured":"D.L. Springer, D.E. Thomas, Exploiting the special structure of conflict and compatibility graphs in high-level synthesis, Internat. Conf. Computer Aided Design, 1990, pp. 254\u2013257.","DOI":"10.1109\/ICCAD.1990.129895"},{"key":"10.1016\/S0167-9260(98)00008-X_BIB12","first-page":"379","article-title":"Automated synthesis of data paths in digital systems","volume":"6","author":"Tseng","year":"1989","journal-title":"IEEE Trans. CAD"},{"key":"10.1016\/S0167-9260(98)00008-X_BIB13","doi-asserted-by":"crossref","unstructured":"R.A. Bergamaschi, R. Camposano, M. Payer, Data-path synthesis using path analysis, 28th Design Automation Conf., 1991, pp. 591\u2013595.","DOI":"10.1145\/127601.127738"},{"key":"10.1016\/S0167-9260(98)00008-X_BIB14","doi-asserted-by":"crossref","unstructured":"F.J. Kurdahi, A.C. Parker, Real: a program for register allocation, 24th Design Automation Conf., 1987, pp. 210\u2013215.","DOI":"10.1145\/37888.37920"},{"key":"10.1016\/S0167-9260(98)00008-X_BIB15","unstructured":"C. Park, T. Kim, C.L. Liu, Register allocation for general data flow graphs, 2nd European Design Automation Conf., 1993, pp. 232\u2013237."},{"key":"10.1016\/S0167-9260(98)00008-X_BIB16","unstructured":"K. Jansen, J. Reiter, Approximation algorithms for register allocation, Universit\u00e4t Trier, Forschungsbericht 13, 1996."},{"key":"10.1016\/S0167-9260(98)00008-X_BIB17","unstructured":"S. Kannan, T. Proebsting, Register allocation in structured programs, Symp. on Discrete Algorithms (SODA), 1995, pp. 360\u2013368."},{"key":"10.1016\/S0167-9260(98)00008-X_BIB18","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0304-3975(92)90126-Z","article-title":"Processor-optimization for flow graphs","volume":"104","author":"Jansen","year":"1992","journal-title":"Theoret. Comput. Sci."}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016792609800008X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016792609800008X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T09:10:32Z","timestamp":1759137032000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016792609800008X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,11]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,11]]}},"alternative-id":["S016792609800008X"],"URL":"https:\/\/doi.org\/10.1016\/s0167-9260(98)00008-x","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[1998,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An approximation algorithm for the register allocation problem","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0167-9260(98)00008-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}