{"id":"https://openalex.org/W3133549410","doi":"https://doi.org/10.1145/3453483.3454088","title":"Hashing modulo alpha-equivalence","display_name":"Hashing modulo alpha-equivalence","publication_year":2021,"publication_date":"2021-06-18","ids":{"openalex":"https://openalex.org/W3133549410","doi":"https://doi.org/10.1145/3453483.3454088","mag":"3133549410"},"language":"en","primary_location":{"id":"doi:10.1145/3453483.3454088","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3453483.3454088","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation","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/A5022880503","display_name":"Krzysztof Maziarz","orcid":null},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Krzysztof Maziarz","raw_affiliation_strings":["Microsoft Research, UK"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, UK","institution_ids":["https://openalex.org/I4210164937"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078172160","display_name":"T. M. R. Ellis","orcid":"https://orcid.org/0000-0003-4894-6770"},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Tom Ellis","raw_affiliation_strings":["Microsoft Research, UK"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, UK","institution_ids":["https://openalex.org/I4210164937"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063155882","display_name":"Alan Lawrence","orcid":null},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Alan Lawrence","raw_affiliation_strings":["Microsoft Research, UK"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, UK","institution_ids":["https://openalex.org/I4210164937"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018851970","display_name":"Andrew Fitzgibbon","orcid":"https://orcid.org/0000-0002-9839-660X"},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Andrew Fitzgibbon","raw_affiliation_strings":["Microsoft Research, UK"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, UK","institution_ids":["https://openalex.org/I4210164937"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027817074","display_name":"Simon Peyton Jones","orcid":"https://orcid.org/0000-0002-6085-1435"},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Simon Peyton Jones","raw_affiliation_strings":["Microsoft Research, UK"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, UK","institution_ids":["https://openalex.org/I4210164937"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5022880503"],"corresponding_institution_ids":["https://openalex.org/I4210164937"],"apc_list":null,"apc_paid":null,"fwci":1.6524,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.86432703,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"960","last_page":"973"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10260","display_name":"Software Engineering Research","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10260","display_name":"Software Engineering Research","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11241","display_name":"Advanced Malware Detection Techniques","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.998199999332428,"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/modulo","display_name":"Modulo","score":0.8445661067962646},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.7339955568313599},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5806741714477539},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4810259938240051},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47384530305862427},{"id":"https://openalex.org/keywords/alpha","display_name":"Alpha (finance)","score":0.4240192472934723},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41155102849006653},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39437976479530334},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3851022720336914},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08089762926101685}],"concepts":[{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.8445661067962646},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.7339955568313599},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5806741714477539},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4810259938240051},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47384530305862427},{"id":"https://openalex.org/C64943373","wikidata":"https://www.wikidata.org/wiki/Q2651003","display_name":"Alpha (finance)","level":4,"score":0.4240192472934723},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41155102849006653},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39437976479530334},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3851022720336914},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08089762926101685},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C49453240","wikidata":"https://www.wikidata.org/wiki/Q1592163","display_name":"Construct validity","level":3,"score":0.0},{"id":"https://openalex.org/C171606756","wikidata":"https://www.wikidata.org/wiki/Q506132","display_name":"Psychometrics","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3453483.3454088","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3453483.3454088","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1550328346","https://openalex.org/W2046024168","https://openalex.org/W2067976080","https://openalex.org/W2071866471","https://openalex.org/W2091657052","https://openalex.org/W2121757479","https://openalex.org/W2293570177","https://openalex.org/W2293891280","https://openalex.org/W2296677810","https://openalex.org/W2739952727","https://openalex.org/W2765574772","https://openalex.org/W2793476006","https://openalex.org/W2804660315","https://openalex.org/W2825587979","https://openalex.org/W2911495555","https://openalex.org/W3102619008","https://openalex.org/W3145094436"],"related_works":["https://openalex.org/W2070252991","https://openalex.org/W2807449856","https://openalex.org/W238211858","https://openalex.org/W2941201715","https://openalex.org/W2803761277","https://openalex.org/W4297742300","https://openalex.org/W4295096867","https://openalex.org/W4291557013","https://openalex.org/W2291802014","https://openalex.org/W3023219121"],"abstract_inverted_index":{"In":[0],"many":[1],"applications":[2],"one":[3,71],"wants":[4],"to":[5,20,32,51,62,106],"identify":[6],"identical":[7],"subtrees":[8],"of":[9,22,58,90,110],"a":[10,46,64,96],"program":[11],"syntax":[12],"tree.":[13],"This":[14],"identification":[15],"should":[16],"ideally":[17],"be":[18],"robust":[19],"alpha-renaming":[21],"the":[23,74,88,91,107,111],"program,":[24],"but":[25],"no":[26],"existing":[27],"technique":[28],"has":[29],"been":[30],"shown":[31],"achieve":[33],"this":[34],"with":[35,80,99],"good":[36],"efficiency":[37],"(better":[38],"than":[39],"O(n2)":[40],"in":[41,73],"expression":[42],"size).":[43],"We":[44,85],"present":[45],"new,":[47],"asymptotically":[48],"efficient":[49],"way":[50],"hash":[52,67,98],"modulo":[53],"alpha-equivalence.":[54],"A":[55],"key":[56],"insight":[57],"our":[59],"method":[60],"is":[61],"use":[63,89],"weak":[65],"(commutative)":[66],"combiner":[68,93],"at":[69],"exactly":[70],"point":[72],"construction,":[75],"which":[76],"admits":[77],"an":[78],"algorithm":[79],"O(n":[81],"(logn)2)":[82],"time":[83],"complexity.":[84],"prove":[86],"that":[87],"commutative":[92],"nevertheless":[94],"yields":[95],"strong":[97],"low":[100],"collision":[101],"probability.":[102],"Numerical":[103],"benchmarks":[104],"attest":[105],"asymptotic":[108],"behaviour":[109],"method.":[112]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}