{"id":"https://openalex.org/W2090992322","doi":"https://doi.org/10.1145/2463596.2463598","title":"Optimal placement of bank selection instructions in polynomial time","display_name":"Optimal placement of bank selection instructions in polynomial time","publication_year":2013,"publication_date":"2013-06-18","ids":{"openalex":"https://openalex.org/W2090992322","doi":"https://doi.org/10.1145/2463596.2463598","mag":"2090992322"},"language":"en","primary_location":{"id":"doi:10.1145/2463596.2463598","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2463596.2463598","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems","raw_type":"proceedings-article"},"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/A5086807055","display_name":"Philipp Klaus Krause","orcid":"https://orcid.org/0000-0002-6668-7891"},"institutions":[{"id":"https://openalex.org/I114090438","display_name":"Goethe University Frankfurt","ror":"https://ror.org/04cvxnb49","country_code":"DE","type":"education","lineage":["https://openalex.org/I114090438"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Philipp Klaus Krause","raw_affiliation_strings":["Goethe-Universit\u00e4t, Frankfurt am Main, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Goethe-Universit\u00e4t, Frankfurt am Main, Germany","institution_ids":["https://openalex.org/I114090438"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5086807055"],"corresponding_institution_ids":["https://openalex.org/I114090438"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"121","issue":null,"first_page":"23","last_page":"30"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9991000294685364,"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/T10142","display_name":"Formal Methods in Verification","score":0.9991000294685364,"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.9980000257492065,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/compiler","display_name":"Compiler","score":0.7873765826225281},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7413398623466492},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.6760002374649048},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5557679533958435},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49476855993270874},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.450001060962677},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4061531126499176},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3713434338569641},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3397876024246216},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3201698064804077},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2679336667060852},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18354260921478271},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17277520895004272}],"concepts":[{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.7873765826225281},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7413398623466492},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.6760002374649048},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5557679533958435},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49476855993270874},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.450001060962677},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4061531126499176},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3713434338569641},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3397876024246216},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3201698064804077},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2679336667060852},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18354260921478271},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17277520895004272},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2463596.2463598","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2463596.2463598","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1268618305","display_name":null,"funder_award_id":"AD 411/1-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320875","display_name":"Deutscher Akademischer Austauschdienst","ror":"https://ror.org/039djdh30"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W41457056","https://openalex.org/W104370704","https://openalex.org/W1982134186","https://openalex.org/W1986368246","https://openalex.org/W1989556004","https://openalex.org/W1989787788","https://openalex.org/W1995362766","https://openalex.org/W2033405938","https://openalex.org/W2045695359","https://openalex.org/W2059372025","https://openalex.org/W2072099942","https://openalex.org/W2082504162","https://openalex.org/W2121713258","https://openalex.org/W2145188184","https://openalex.org/W2607159714","https://openalex.org/W4232696454"],"related_works":["https://openalex.org/W4240253816","https://openalex.org/W3096456556","https://openalex.org/W2169584677","https://openalex.org/W2979513934","https://openalex.org/W4232954277","https://openalex.org/W2020341030","https://openalex.org/W2749133591","https://openalex.org/W2367473450","https://openalex.org/W23346600","https://openalex.org/W1774334694"],"abstract_inverted_index":{"We":[0],"present":[1],"the":[2,31,57,70,85],"first":[3],"approach":[4,29,92],"to":[5,34,53,67,97],"Optimal":[6],"Placement":[7],"of":[8,59,88],"Bank":[9],"Selection":[10],"Instructions":[11],"in":[12,25,77],"Polynomial":[13],"Time;":[14],"previous":[15],"approaches":[16],"were":[17],"not":[18,22,65],"optimal":[19],"or":[20],"did":[21],"provably":[23],"run":[24],"polynomial":[26],"time.":[27],"Our":[28,91],"requires":[30],"input":[32],"program":[33],"be":[35],"structured,":[36],"which":[37],"is":[38,51,72],"automatically":[39],"true":[40],"for":[41,46,81,99],"many":[42],"programming":[43],"languages":[44],"and":[45,93,103],"others,":[47],"such":[48],"as":[49],"C,":[50],"equivalent":[52],"a":[54,78],"bound":[55],"on":[56],"number":[58],"goto":[60],"labels":[61],"per":[62],"function.":[63],"When":[64],"restricted":[66],"structured":[68],"programs,":[69],"problem":[71],"NP-hard.":[73],"A":[74],"prototype":[75],"implementation":[76,94],"mainstream":[79],"compiler":[80],"embedded":[82],"systems":[83],"shows":[84],"practical":[86],"feasibility":[87],"our":[89],"approach.":[90],"are":[95],"easy":[96],"retarget":[98],"different":[100],"optimization":[101],"goals":[102],"architectures.":[104]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}