{"id":"https://openalex.org/W3142570912","doi":"https://doi.org/10.1109/aspdac.2011.5722255","title":"A polynomial-time custom instruction identification algorithm based on dynamic programming","display_name":"A polynomial-time custom instruction identification algorithm based on dynamic programming","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W3142570912","doi":"https://doi.org/10.1109/aspdac.2011.5722255","mag":"3142570912"},"language":"en","primary_location":{"id":"doi:10.1109/aspdac.2011.5722255","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2011.5722255","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"16th Asia and South Pacific Design Automation Conference (ASP-DAC 2011)","raw_type":"proceedings-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/A5029188471","display_name":"Junwhan Ahn","orcid":"https://orcid.org/0000-0001-7613-0571"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Junwhan Ahn","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, Seoul National University, South Korea"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Seoul National University, South Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029354806","display_name":"Imyong Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Imyong Lee","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, Seoul National University, South Korea"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Seoul National University, South Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043594476","display_name":"Ki\u2010Young Choi","orcid":"https://orcid.org/0000-0001-6138-6697"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Kiyoung Choi","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, Seoul National University, South Korea"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Seoul National University, South Korea","institution_ids":["https://openalex.org/I139264467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5029188471"],"corresponding_institution_ids":["https://openalex.org/I139264467"],"apc_list":null,"apc_paid":null,"fwci":0.7556,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.75851866,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"573","last_page":"578"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/correctness","display_name":"Correctness","score":0.784180760383606},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6798179745674133},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.6584335565567017},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5776033401489258},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5493540167808533},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5049853920936584},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4461475610733032},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4320718050003052},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.42342615127563477},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38489094376564026},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22384712100028992},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21785202622413635}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.784180760383606},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6798179745674133},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.6584335565567017},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5776033401489258},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5493540167808533},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5049853920936584},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4461475610733032},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4320718050003052},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.42342615127563477},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38489094376564026},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22384712100028992},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21785202622413635},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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.1109/aspdac.2011.5722255","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2011.5722255","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"16th Asia and South Pacific Design Automation Conference (ASP-DAC 2011)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W2034841960","https://openalex.org/W2048586388","https://openalex.org/W2050302227","https://openalex.org/W2096820905","https://openalex.org/W2121507132","https://openalex.org/W2134084674","https://openalex.org/W2165892109","https://openalex.org/W2169406908","https://openalex.org/W2171697422"],"related_works":["https://openalex.org/W17155033","https://openalex.org/W3207760230","https://openalex.org/W1496222301","https://openalex.org/W1590307681","https://openalex.org/W2536018345","https://openalex.org/W4312814274","https://openalex.org/W4285370786","https://openalex.org/W2296488620","https://openalex.org/W2358353312","https://openalex.org/W1774334694"],"abstract_inverted_index":{"This":[0],"paper":[1],"introduces":[2],"an":[3,64],"innovative":[4],"algorithm":[5,25,34,45,62,98],"for":[6,67],"automatic":[7],"instruction-set":[8],"extension,":[9],"which":[10],"gives":[11,63],"a":[12,22],"pseudo-optimal":[13],"solution":[14,66,81],"within":[15],"polynomial":[16],"time":[17,50],"to":[18,37],"the":[19,32,44,61,93,96],"size":[20],"of":[21,40,43,70,78,92],"graph.":[23],"The":[24],"uses":[26],"top-down":[27],"dynamic":[28],"programming":[29],"strategy":[30],"with":[31],"branch-and-bound":[33],"in":[35,82],"order":[36],"exploit":[38],"overlapping":[39],"subproblems.":[41],"Correctness":[42],"is":[46,52,58],"formally":[47],"proved,":[48],"and":[49,73],"complexity":[51],"analyzed":[53],"from":[54],"it.":[55],"Also,":[56],"it":[57],"verified":[59],"that":[60,95],"optimal":[65],"some":[68],"type":[69],"merit":[71],"functions,":[72],"has":[74,99],"very":[75],"small":[76],"possibility":[77],"obtaining":[79],"non-optimal":[80],"general.":[83],"Furthermore,":[84],"several":[85],"experimental":[86],"results":[87],"are":[88],"presented":[89],"as":[90],"evidence":[91],"fact":[94],"proposed":[97],"notable":[100],"performance":[101],"improvement.":[102]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}