{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T05:27:28Z","timestamp":1734067648297,"version":"3.30.2"},"reference-count":23,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"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":["Signal Processing"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0165-1684(03)00089-6","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T19:14:59Z","timestamp":1053371699000},"page":"1411-1425","source":"Crossref","is-referenced-by-count":16,"title":["List-coloring of interval graphs with application to register assignment for heterogeneous register-set architectures"],"prefix":"10.1016","volume":"83","author":[{"given":"Thomas","family":"Zeitlhofer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"Wess","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0165-1684(03)00089-6_BIB1","unstructured":"D.A. Berson, R. Gupta, M.L. Soffa, HARE: a hierarchical allocator for registers in multiple issue architectures, Technical Report TR 95-06, Computer Science Department, University of Pittsburgh, February 1995."},{"key":"10.1016\/S0165-1684(03)00089-6_BIB2","first-page":"1","article-title":"A tourist guide through treewidth","volume":"11","author":"Bodlaender","year":"1993","journal-title":"Acta Cybernet."},{"key":"10.1016\/S0165-1684(03)00089-6_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","article-title":"A partial k-arboretum of graphs with bounded treewidth","volume":"209","author":"Bodlaender","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0165-1684(03)00089-6_BIB4","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs, and graph planarity using Pq-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/S0165-1684(03)00089-6_BIB5","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1145\/177492.177575","article-title":"Improvements to graph coloring register allocation","volume":"16","author":"Briggs","year":"1994","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/S0165-1684(03)00089-6_BIB6","doi-asserted-by":"crossref","unstructured":"D. Callahan, B. Koblenz, Register allocation via hierarchical graph coloring, in: Proceedings of the ACM Conference on Programming Language Design and Implementation, Toronto, Ontario, Canada, 1991, pp. 192\u2013202.","DOI":"10.1145\/113445.113462"},{"issue":"6","key":"10.1016\/S0165-1684(03)00089-6_BIB7","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1145\/872726.806984","article-title":"Register allocation & spilling via graph coloring","volume":"17","author":"Chaitin","year":"1982","journal-title":"ACM SIGPLAN Notices"},{"key":"10.1016\/S0165-1684(03)00089-6_BIB8","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0096-0551(81)90048-5","article-title":"Register allocation via coloring","volume":"6","author":"Chaitin","year":"1981","journal-title":"Comput. Languages"},{"key":"10.1016\/S0165-1684(03)00089-6_BIB9","unstructured":"Z. Chamski, C. Eisenbeis, E. Rohou, Flexible issue slot assignment for VLIW architectures, Fourth International Workshop on Software and Compilers for Embedded Systems, Schloss Rheinfels, St. Goar, Germany, September 1999."},{"issue":"3","key":"10.1016\/S0165-1684(03)00089-6_BIB10","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1145\/315773.315776","article-title":"Code generation of nested loops for DSP processors with heterogeneous registers and structural pipelining","volume":"4","author":"Cheng","year":"1999","journal-title":"ACM Trans. Design Automat. Electron. Systems"},{"issue":"6","key":"10.1016\/S0165-1684(03)00089-6_BIB11","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1145\/502949.502896","article-title":"Register allocation by priority-based coloring","volume":"19","author":"Chow","year":"1984","journal-title":"ACM SIGPLAN Notices"},{"year":"2000","series-title":"Graph Theory","author":"Diestel","key":"10.1016\/S0165-1684(03)00089-6_BIB12"},{"year":"1980","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","key":"10.1016\/S0165-1684(03)00089-6_BIB13"},{"key":"10.1016\/S0165-1684(03)00089-6_BIB14","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0166-218X(01)00179-2","article-title":"Complexity of list coloring problems with a fixed total number of colors","volume":"117","author":"Gravier","year":"2002","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0165-1684(03)00089-6_BIB15","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0166-218X(96)00085-6","article-title":"Generalized coloring for tree-like graphs","volume":"75","author":"Jansen","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0165-1684(03)00089-6_BIB16","doi-asserted-by":"crossref","unstructured":"D.J. Kolson, A. Nicolau, N. Dutt, K. Kennedy, Optimal register assignment to loops for embedded code generation, Technical Report 95-46, University of California, Irvine, July, 1995.","DOI":"10.1109\/ISSS.1995.520611"},{"issue":"3","key":"10.1016\/S0165-1684(03)00089-6_BIB17","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/356819.356822","article-title":"Local microcode compaction techniques","volume":"12","author":"Landskov","year":"1980","journal-title":"ACM Comput. Surveys"},{"issue":"1","key":"10.1016\/S0165-1684(03)00089-6_BIB18","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/TC.1987.5009446","article-title":"Static scheduling of synchronous data flow programs for digital signal processing","volume":"C-36","author":"Lee","year":"1987","journal-title":"IEEE Trans. Comput."},{"issue":"9","key":"10.1016\/S0165-1684(03)00089-6_BIB19","doi-asserted-by":"crossref","first-page":"1235","DOI":"10.1109\/PROC.1987.13876","article-title":"Synchronous data flow","volume":"75","author":"Lee","year":"1987","journal-title":"Proc. IEEE"},{"key":"10.1016\/S0165-1684(03)00089-6_BIB20","doi-asserted-by":"crossref","unstructured":"P. Pinter, Register allocation with instruction scheduling: a new approach, in: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, Albuquerque, 1993, pp. 248\u2013257.","DOI":"10.1145\/155090.155114"},{"issue":"4","key":"10.1016\/S0165-1684(03)00089-6_BIB21","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1145\/362652.362660","article-title":"Constraint analysis for code generation","volume":"5","author":"van Eijk","year":"2000","journal-title":"ACM Trans. Design Automat. Electron. Systems"},{"key":"10.1016\/S0165-1684(03)00089-6_BIB22","doi-asserted-by":"crossref","unstructured":"T. Zeitlhofer, B. Wess, Operation scheduling for parallel functional units using genetic algorithms, in: Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, Phoenix, AZ, USA, 1999.","DOI":"10.1109\/ICASSP.1999.758319"},{"key":"10.1016\/S0165-1684(03)00089-6_BIB23","doi-asserted-by":"crossref","unstructured":"T. Zeitlhofer, B. Wess, Integrated scheduling and register assignment for VLIW-DSP architectures, in: Proceedings of the 14th IEEE International ASIC\/SOC Conference, Washington, DC, USA, 2001, 339\u2013343.","DOI":"10.1109\/ASIC.2001.954724"}],"container-title":["Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0165168403000896?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0165168403000896?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T16:11:48Z","timestamp":1734019908000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0165168403000896"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":23,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0165168403000896"],"URL":"https:\/\/doi.org\/10.1016\/s0165-1684(03)00089-6","relation":{},"ISSN":["0165-1684"],"issn-type":[{"type":"print","value":"0165-1684"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}