{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:48:56Z","timestamp":1772164136441,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[1989,6,21]],"date-time":"1989-06-21T00:00:00Z","timestamp":614390400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[1989,6,21]]},"DOI":"10.1145\/73141.74841","type":"proceedings-article","created":{"date-parts":[[2003,11,14]],"date-time":"2003-11-14T11:24:15Z","timestamp":1068809055000},"page":"258-263","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":52,"title":["Spill code minimization techniques for optimizing compliers"],"prefix":"10.1145","author":[{"given":"D.","family":"Bernstein","sequence":"first","affiliation":[{"name":"IBM Israel Science and Technology, Technion City, Haifa, Israel"}]},{"given":"M.","family":"Golumbic","sequence":"additional","affiliation":[{"name":"IBM Israel Science and Technology, Technion City, Haifa, Israel"}]},{"given":"y.","family":"Mansour","sequence":"additional","affiliation":[{"name":"IBM Israel Science and Technology, Technion City, Haifa, Israel"}]},{"given":"R.","family":"Pinter","sequence":"additional","affiliation":[{"name":"IBM Israel Science and Technology, Technion City, Haifa, Israel"}]},{"given":"D.","family":"Goldin","sequence":"additional","affiliation":[{"name":"IBM Israel Science and Technology, Technion City, Haifa, Israel"}]},{"given":"H.","family":"Krawczyk","sequence":"additional","affiliation":[{"name":"IBM Israel Science and Technology, Technion City, Haifa, Israel"}]},{"given":"I.","family":"Nahshon","sequence":"additional","affiliation":[{"name":"IBM Israel Science and Technology, Technion City, Haifa, Israel"}]}],"member":"320","published-online":{"date-parts":[[1989,6,21]]},"reference":[{"key":"e_1_3_2_1_1_2","doi-asserted-by":"publisher","DOI":"10.1145\/800230.806977"},{"key":"e_1_3_2_1_2_2","volume-title":"Random Graphs","author":"Bollobas B.","year":"1985","unstructured":"Bollobas , B. , Random Graphs , Academic Press , London , 1985 . Bollobas, B., Random Graphs, Academic Press, London, 1985."},{"key":"e_1_3_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/359094.359101"},{"key":"e_1_3_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.5555\/2245737.2245881"},{"key":"e_1_3_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/800230.806984"},{"key":"e_1_3_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/502874.502896"},{"key":"e_1_3_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(88)90032-7"},{"key":"e_1_3_2_1_8_2","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbie M.C.","year":"1980","unstructured":"Golumbie , M.C. , Algorithmic Graph Theory and Perfect Graphs , Academic Press , New York , 1980 . Golumbie, M.C., Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980."},{"key":"e_1_3_2_1_9_2","volume-title":"~lnterval Graphs and Related Topics', a special issue of Discrete Math. 55","author":"Golumbic M. C.","year":"1985","unstructured":"Golumbic , M. C. , ed., ~lnterval Graphs and Related Topics', a special issue of Discrete Math. 55 ( 1985 ), 113-243. Golumbic, M. C., ed., ~lnterval Graphs and Related Topics', a special issue of Discrete Math. 55 (1985), 113-243."},{"key":"e_1_3_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/12276.13337"},{"key":"e_1_3_2_1_11_2","volume-title":"Graph Theory and Computing","author":"Matula D.W.","year":"1972","unstructured":"Matula , D.W. , Marble , G. , and Isaacson , J.D. , ' Graph coloring algorithms ', in Graph Theory and Computing , (Read, R.C., ed.), Academic Press , New York , 1972 . Matula, D.W., Marble, G., and Isaacson, J.D., 'Graph coloring algorithms', in Graph Theory and Computing, (Read, R.C., ed.), Academic Press, New York, 1972."},{"key":"e_1_3_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/12276.13338"}],"event":{"name":"PLDI89: Programming Language Design & Implementation","location":"Portland Oregon USA","acronym":"PLDI89","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the ACM SIGPLAN 1989 conference on Programming language design and implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/73141.74841","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/73141.74841","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:14:56Z","timestamp":1750266896000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/73141.74841"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6,21]]},"references-count":12,"alternative-id":["10.1145\/73141.74841","10.1145\/73141"],"URL":"https:\/\/doi.org\/10.1145\/73141.74841","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/74818.74841","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[1989,6,21]]},"assertion":[{"value":"1989-06-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}