{"id":"https://openalex.org/W4246513558","doi":"https://doi.org/10.1109/aspdac.2006.1594702","title":"An O(mn) time algorithm for optimal buffer insertion of nets with m sinks","display_name":"An O(mn) time algorithm for optimal buffer insertion of nets with m sinks","publication_year":2006,"publication_date":"2006-03-22","ids":{"openalex":"https://openalex.org/W4246513558","doi":"https://doi.org/10.1109/aspdac.2006.1594702"},"language":"en","primary_location":{"id":"doi:10.1109/aspdac.2006.1594702","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2006.1594702","pdf_url":null,"source":{"id":"https://openalex.org/S4363608292","display_name":"Asia and South Pacific Conference on Design Automation, 2006.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Asia and South Pacific Conference on Design Automation, 2006.","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/A5100448048","display_name":"Zhuo Li","orcid":"https://orcid.org/0000-0003-4554-6018"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhuo Li","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Texas A and M University, College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Texas A and M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100899003","display_name":"Weiping Shi","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Weiping Shi","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Texas A and M University, College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Texas A and M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.3061829,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"24","issue":null,"first_page":"320","last_page":"325"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9818999767303467,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9818999767303467,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.979200005531311,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9781000018119812,"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/algorithm","display_name":"Algorithm","score":0.7220858931541443},{"id":"https://openalex.org/keywords/buffer","display_name":"Buffer (optical fiber)","score":0.6517975926399231},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.6229771375656128},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5199928879737854},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45807382464408875},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4034532308578491},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33618950843811035},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.2904314398765564},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.10688668489456177},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.08693748712539673}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7220858931541443},{"id":"https://openalex.org/C145018004","wikidata":"https://www.wikidata.org/wiki/Q4985944","display_name":"Buffer (optical fiber)","level":2,"score":0.6517975926399231},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.6229771375656128},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5199928879737854},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45807382464408875},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4034532308578491},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33618950843811035},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2904314398765564},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.10688668489456177},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.08693748712539673}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/aspdac.2006.1594702","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2006.1594702","pdf_url":null,"source":{"id":"https://openalex.org/S4363608292","display_name":"Asia and South Pacific Conference on Design Automation, 2006.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Asia and South Pacific Conference on Design Automation, 2006.","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":13,"referenced_works":["https://openalex.org/W1607679225","https://openalex.org/W2012173826","https://openalex.org/W2068674204","https://openalex.org/W2123316553","https://openalex.org/W2127434816","https://openalex.org/W2134249452","https://openalex.org/W2147112599","https://openalex.org/W2160252016","https://openalex.org/W4232214728","https://openalex.org/W4234887147","https://openalex.org/W4241701321","https://openalex.org/W4249030878","https://openalex.org/W6641919570"],"related_works":["https://openalex.org/W2097227107","https://openalex.org/W2366025885","https://openalex.org/W2051487156","https://openalex.org/W4233342643","https://openalex.org/W2073681303","https://openalex.org/W82233118","https://openalex.org/W2408755413","https://openalex.org/W2184324190","https://openalex.org/W4243779378","https://openalex.org/W2047375893"],"abstract_inverted_index":{"Buffer":[0],"insertion":[1,46],"is":[2,26,33,40,57,60,104,142],"an":[3,94,113,149],"effective":[4],"technique":[5],"to":[6],"reduce":[7],"interconnect":[8],"delay.":[9],"In":[10],"this":[11],"paper,":[12],"we":[13],"give":[14],"a":[15,61,108,124,129],"simple":[16],"O(mn)":[17],"time":[18,44,69,75],"algorithm":[19,47,76,86,141],"for":[20,48],"optimal":[21],"buffer":[22,37,45,82,130],"insertion,":[23],"where":[24],"m":[25,56],"the":[27,34,41,72,84,139],"number":[28,35,52],"of":[29,36,53,77,96,123,128,151],"sinks":[30],"and":[31,71,112,126],"n":[32],"positions.":[38],"This":[39],"first":[42],"linear":[43],"nets":[49],"with":[50],"constant":[51],"sinks.":[54],"When":[55],"small,":[58],"it":[59],"significant":[62],"improvement":[63,95,103],"over":[64],"our":[65,97],"recent":[66,98],"O(nlog/sup":[67],"2/n)":[68],"algorithm,":[70],"O(n/sup":[73],"2/)":[74,100],"van":[78],"Ginneken.":[79],"For":[80],"b":[81],"types,":[83],"new":[85,140],"runs":[87],"in":[88,131],"O(b/sup":[89],"2/n":[90],"+":[91],"bmn)":[92],"time,":[93],"O(bn/sup":[99],"algorithm.":[101],"The":[102],"made":[105],"possible":[106],"by":[107,148],"clever":[109],"bookkeeping":[110],"method":[111],"innovative":[114],"linked":[115],"list":[116],"data":[117],"structure":[118],"that":[119],"can":[120],"perform":[121],"addition":[122,127],"wire,":[125],"amortized":[132],"O(1)":[133],"time.":[134],"On":[135],"industrial":[136],"test":[137],"cases,":[138],"faster":[143],"than":[144],"previous":[145],"best":[146],"algorithms":[147],"order":[150],"magnitude.":[152]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}