{"id":"https://openalex.org/W2151621230","doi":"https://doi.org/10.1145/1120725.1120965","title":"Improved Boolean function hashing based on multiple-vertex dominators","display_name":"Improved Boolean function hashing based on multiple-vertex dominators","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2151621230","doi":"https://doi.org/10.1145/1120725.1120965","mag":"2151621230"},"language":"en","primary_location":{"id":"doi:10.1145/1120725.1120965","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1120725.1120965","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 conference on Asia South Pacific design automation - ASP-DAC '05","raw_type":"proceedings-article"},"type":"conference-abstract","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/A5040692022","display_name":"Ren\u00e9 Krenz","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Ren\u00e9 Krenz","raw_affiliation_strings":["IMIT-KTH, Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IMIT-KTH, Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011438358","display_name":"Elena Dubrova","orcid":"https://orcid.org/0000-0001-7382-9408"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Elena Dubrova","raw_affiliation_strings":["IMIT-KTH, Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IMIT-KTH, Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"573","last_page":"573"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10951","display_name":"Cryptographic Implementations and Security","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T10951","display_name":"Cryptographic Implementations and Security","score":0.9991999864578247,"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"}},{"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/formal-equivalence-checking","display_name":"Formal equivalence checking","score":0.6813868880271912},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6795922517776489},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.6346617937088013},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.6060121655464172},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5427743196487427},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.534639835357666},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.4668254256248474},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.46078598499298096},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45992574095726013},{"id":"https://openalex.org/keywords/k-independent-hashing","display_name":"K-independent hashing","score":0.44496583938598633},{"id":"https://openalex.org/keywords/dynamic-perfect-hashing","display_name":"Dynamic perfect hashing","score":0.417497843503952},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.3411716818809509},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.2844220995903015},{"id":"https://openalex.org/keywords/perfect-hash-function","display_name":"Perfect hash function","score":0.27289432287216187},{"id":"https://openalex.org/keywords/double-hashing","display_name":"Double hashing","score":0.11812165379524231}],"concepts":[{"id":"https://openalex.org/C96654402","wikidata":"https://www.wikidata.org/wiki/Q5469962","display_name":"Formal equivalence checking","level":3,"score":0.6813868880271912},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6795922517776489},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.6346617937088013},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.6060121655464172},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5427743196487427},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.534639835357666},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.4668254256248474},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.46078598499298096},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45992574095726013},{"id":"https://openalex.org/C187062812","wikidata":"https://www.wikidata.org/wiki/Q6322840","display_name":"K-independent hashing","level":5,"score":0.44496583938598633},{"id":"https://openalex.org/C122907437","wikidata":"https://www.wikidata.org/wiki/Q5318999","display_name":"Dynamic perfect hashing","level":5,"score":0.417497843503952},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.3411716818809509},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.2844220995903015},{"id":"https://openalex.org/C87431388","wikidata":"https://www.wikidata.org/wiki/Q2070573","display_name":"Perfect hash function","level":4,"score":0.27289432287216187},{"id":"https://openalex.org/C138111711","wikidata":"https://www.wikidata.org/wiki/Q478351","display_name":"Double hashing","level":4,"score":0.11812165379524231},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"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/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1120725.1120965","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1120725.1120965","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 conference on Asia South Pacific design automation - ASP-DAC '05","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":17,"referenced_works":["https://openalex.org/W1976357819","https://openalex.org/W1989787788","https://openalex.org/W2003312024","https://openalex.org/W2014064621","https://openalex.org/W2018368463","https://openalex.org/W2020640915","https://openalex.org/W2069530808","https://openalex.org/W2092576944","https://openalex.org/W2106462831","https://openalex.org/W2111379929","https://openalex.org/W2133246738","https://openalex.org/W2138838211","https://openalex.org/W2150864252","https://openalex.org/W2158102622","https://openalex.org/W2167435507","https://openalex.org/W2295428206","https://openalex.org/W3141297747"],"related_works":["https://openalex.org/W2811247857","https://openalex.org/W2094127768","https://openalex.org/W3108021595","https://openalex.org/W4385382899","https://openalex.org/W2084899141","https://openalex.org/W2149143947","https://openalex.org/W2072057882","https://openalex.org/W102859714","https://openalex.org/W2740037903","https://openalex.org/W2728476733"],"abstract_inverted_index":{"The":[0,59,84,99],"growing":[1],"complexity":[2],"of":[3,45,108],"today's":[4],"system":[5],"designs":[6],"requires":[7],"fast":[8],"and":[9,56],"robust":[10],"verification":[11,26,34],"methods.":[12],"Existing":[13],"BDD,":[14],"SAT":[15],"or":[16],"ATPG-based":[17],"techniques":[18],"do":[19],"not":[20],"provide":[21],"sufficient":[22],"solutions":[23],"for":[24,79],"many":[25],"instances.":[27],"Boolean":[28,72],"function":[29,73],"hashing":[30,61,97],"is":[31,63],"a":[32,43,71,75,80],"probabilistic":[33,76],"approach":[35],"which":[36,69],"can":[37],"complement":[38],"existing":[39],"formal":[40],"methods":[41],"in":[42,90],"number":[44],"applications":[46],"such":[47],"as":[48],"equivalence":[49],"checking,":[50],"biased":[51],"random":[52],"simulation,":[53],"power":[54,57],"analysis":[55],"optimization.":[58],"proposed":[60],"technique":[62],"based":[64],"on":[65,102],"the":[66,106],"arithmetic":[67],"transform,":[68],"maps":[70],"onto":[74],"hash":[77],"value":[78],"given":[81],"input":[82],"assignment.":[83],"presented":[85],"algorithm":[86],"uses":[87],"multiple-vertex":[88],"dominators":[89],"circuit":[91],"graphs":[92],"to":[93],"progressively":[94],"simplify":[95],"intermediate":[96],"steps.":[98],"experimental":[100],"results":[101],"benchmark":[103],"circuits":[104],"demonstrate":[105],"robustness":[107],"our":[109],"approach.":[110]},"counts_by_year":[],"updated_date":"2026-07-19T07:52:34.831488","created_date":"2025-10-10T00:00:00"}