{"id":"https://openalex.org/W2151972839","doi":"https://doi.org/10.1016/j.ipl.2006.01.008","title":"Optimal register allocation for SSA-form programs in polynomial time","display_name":"Optimal register allocation for SSA-form programs in polynomial time","publication_year":2006,"publication_date":"2006-02-20","ids":{"openalex":"https://openalex.org/W2151972839","doi":"https://doi.org/10.1016/j.ipl.2006.01.008","mag":"2151972839"},"language":"en","primary_location":{"id":"doi:10.1016/j.ipl.2006.01.008","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.ipl.2006.01.008","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},"type":"article","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/A5018809145","display_name":"Sebastian Hack","orcid":"https://orcid.org/0000-0002-3387-2134"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sebastian Hack","raw_affiliation_strings":["Institut f\u00fcr Programmstrukturen und Datenorganisation, Adenauerring 20a, 76131 Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Programmstrukturen und Datenorganisation, Adenauerring 20a, 76131 Karlsruhe, Germany","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112196458","display_name":"Gerhard Goos","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gerhard Goos","raw_affiliation_strings":["Institut f\u00fcr Programmstrukturen und Datenorganisation, Adenauerring 20a, 76131 Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Programmstrukturen und Datenorganisation, Adenauerring 20a, 76131 Karlsruhe, Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018809145"],"corresponding_institution_ids":[],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":5.2323,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.96176717,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"98","issue":"4","first_page":"150","last_page":"155"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9958999752998352,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9958999752998352,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9955999851226807,"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/T12288","display_name":"Optimization and Search Problems","score":0.9879999756813049,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/register-allocation","display_name":"Register allocation","score":0.8356553316116333},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6160305142402649},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5897998809814453},{"id":"https://openalex.org/keywords/register","display_name":"Register (sociolinguistics)","score":0.5776198506355286},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.4741068482398987},{"id":"https://openalex.org/keywords/optimal-allocation","display_name":"Optimal allocation","score":0.42349737882614136},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3914652466773987},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37420743703842163},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3497621715068817},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3031315207481384},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2556201219558716},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.11493989825248718}],"concepts":[{"id":"https://openalex.org/C128916667","wikidata":"https://www.wikidata.org/wiki/Q1343660","display_name":"Register allocation","level":3,"score":0.8356553316116333},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6160305142402649},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5897998809814453},{"id":"https://openalex.org/C2779235478","wikidata":"https://www.wikidata.org/wiki/Q286576","display_name":"Register (sociolinguistics)","level":2,"score":0.5776198506355286},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.4741068482398987},{"id":"https://openalex.org/C3020013979","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimal allocation","level":2,"score":0.42349737882614136},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3914652466773987},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37420743703842163},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3497621715068817},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3031315207481384},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2556201219558716},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.11493989825248718},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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":1,"locations":[{"id":"doi:10.1016/j.ipl.2006.01.008","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.ipl.2006.01.008","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W144954708","https://openalex.org/W1530458829","https://openalex.org/W1547217239","https://openalex.org/W1973310391","https://openalex.org/W2003804316","https://openalex.org/W2076090418","https://openalex.org/W2111379929","https://openalex.org/W2143474538","https://openalex.org/W2149640383","https://openalex.org/W2320198223","https://openalex.org/W6632926224","https://openalex.org/W6651666023","https://openalex.org/W6669560239"],"related_works":["https://openalex.org/W3013232686","https://openalex.org/W3041671716","https://openalex.org/W2159458033","https://openalex.org/W1844463772","https://openalex.org/W2463380484","https://openalex.org/W1861891114","https://openalex.org/W1497385637","https://openalex.org/W2382311832","https://openalex.org/W1596951257","https://openalex.org/W2151972839"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}