{"id":"https://openalex.org/W1834576908","doi":"https://doi.org/10.1007/bfb0024507","title":"Structured programs have small tree-width and good register allocation","display_name":"Structured programs have small tree-width and good register allocation","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W1834576908","doi":"https://doi.org/10.1007/bfb0024507","mag":"1834576908"},"language":"en","primary_location":{"id":"doi:10.1007/bfb0024507","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0024507","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039232562","display_name":"Mikkel Thorup","orcid":"https://orcid.org/0000-0001-5237-1709"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Mikkel Thorup","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, Universitetsparken 1, 2100 Kbh. \u00d8, Denmark","University of Copenhagen"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Universitetsparken 1, 2100 Kbh. \u00d8, Denmark","institution_ids":["https://openalex.org/I124055696"]},{"raw_affiliation_string":"University of Copenhagen","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5039232562"],"corresponding_institution_ids":["https://openalex.org/I124055696"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.0454,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.73658537,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"318","last_page":"332"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9854999780654907,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6720349788665771},{"id":"https://openalex.org/keywords/register-allocation","display_name":"Register allocation","score":0.6372362971305847},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.5805062651634216},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5143643617630005},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4629330039024353},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.4269348978996277},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3852493166923523},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3508426547050476},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33481520414352417},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33426234126091003},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.259745329618454},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.23455080389976501},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.17294323444366455},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07266587018966675}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6720349788665771},{"id":"https://openalex.org/C128916667","wikidata":"https://www.wikidata.org/wiki/Q1343660","display_name":"Register allocation","level":3,"score":0.6372362971305847},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.5805062651634216},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5143643617630005},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4629330039024353},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.4269348978996277},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3852493166923523},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3508426547050476},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33481520414352417},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33426234126091003},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.259745329618454},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.23455080389976501},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.17294323444366455},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07266587018966675},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/bfb0024507","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0024507","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.50.7877","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.7877","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.diku.dk/diku/semantics/papers/D-281.ps.gz","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/08d59600-74cb-11db-bee9-02004c4f4f50","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/08d59600-74cb-11db-bee9-02004c4f4f50","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Thorup , M 1997 , Structured programs have small tree-width and good register allocation . in Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG) . Springer , pp. 318-332 .","raw_type":"bookPart"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Responsible consumption and production","score":0.49000000953674316,"id":"https://metadata.un.org/sdg/12"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W1491178396","https://openalex.org/W1498962072","https://openalex.org/W1573849647","https://openalex.org/W1969005332","https://openalex.org/W1973310391","https://openalex.org/W1978452004","https://openalex.org/W1983860528","https://openalex.org/W1988661738","https://openalex.org/W1991755800","https://openalex.org/W1994718921","https://openalex.org/W2003804316","https://openalex.org/W2005079828","https://openalex.org/W2008003941","https://openalex.org/W2013967419","https://openalex.org/W2024291212","https://openalex.org/W2027562075","https://openalex.org/W2033405938","https://openalex.org/W2043082448","https://openalex.org/W2043834751","https://openalex.org/W2059453880","https://openalex.org/W2064467943","https://openalex.org/W2064796716","https://openalex.org/W2072099942","https://openalex.org/W2074937107","https://openalex.org/W2085550081","https://openalex.org/W2100139716","https://openalex.org/W2104416102","https://openalex.org/W2118866757","https://openalex.org/W2129133667","https://openalex.org/W2137300667","https://openalex.org/W2153663865","https://openalex.org/W2177002043","https://openalex.org/W2339337913","https://openalex.org/W2611598995","https://openalex.org/W2792939069","https://openalex.org/W2911980423","https://openalex.org/W2986773320","https://openalex.org/W2987803397","https://openalex.org/W3007762642","https://openalex.org/W3148529197","https://openalex.org/W4229550968","https://openalex.org/W4233665923","https://openalex.org/W4235077482","https://openalex.org/W4248893640","https://openalex.org/W4251068092"],"related_works":["https://openalex.org/W2071938427","https://openalex.org/W168043308","https://openalex.org/W1964625315","https://openalex.org/W2273021884","https://openalex.org/W2101182628","https://openalex.org/W14845067","https://openalex.org/W2023200270","https://openalex.org/W4251068092","https://openalex.org/W65799340","https://openalex.org/W2137300667"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}