{"id":"https://openalex.org/W2014586253","doi":"https://doi.org/10.1145/1993636.1993638","title":"The power of simple tabulation hashing","display_name":"The power of simple tabulation hashing","publication_year":2011,"publication_date":"2011-06-06","ids":{"openalex":"https://openalex.org/W2014586253","doi":"https://doi.org/10.1145/1993636.1993638","mag":"2014586253"},"language":"en","primary_location":{"id":"doi:10.1145/1993636.1993638","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1993636.1993638","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993638","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993638","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111909002","display_name":"Mihai P\u01cetra\u015fcu","orcid":null},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mihai Patrascu","raw_affiliation_strings":["AT&T Labs, Florham Park, NJ, USA"],"affiliations":[{"raw_affiliation_string":"AT&T Labs, Florham Park, NJ, USA","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039232562","display_name":"Mikkel Thorup","orcid":"https://orcid.org/0000-0001-5237-1709"},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mikkel Thorup","raw_affiliation_strings":["AT&T Labs, Florham Park, NJ, USA"],"affiliations":[{"raw_affiliation_string":"AT&T Labs, Florham Park, NJ, USA","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111909002"],"corresponding_institution_ids":["https://openalex.org/I1283103587"],"apc_list":null,"apc_paid":null,"fwci":14.11,"has_fulltext":true,"cited_by_count":52,"citation_normalized_percentile":{"value":0.98909739,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.8145188093185425},{"id":"https://openalex.org/keywords/universal-hashing","display_name":"Universal hashing","score":0.6773695945739746},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6553239822387695},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6282875537872314},{"id":"https://openalex.org/keywords/k-independent-hashing","display_name":"K-independent hashing","score":0.5957877039909363},{"id":"https://openalex.org/keywords/dynamic-perfect-hashing","display_name":"Dynamic perfect hashing","score":0.5848469138145447},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5310400128364563},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.5039834380149841},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4835750460624695},{"id":"https://openalex.org/keywords/power-of-two","display_name":"Power of two","score":0.4393324553966522},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4314681589603424},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38299453258514404},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.369914174079895},{"id":"https://openalex.org/keywords/perfect-hash-function","display_name":"Perfect hash function","score":0.36021536588668823},{"id":"https://openalex.org/keywords/double-hashing","display_name":"Double hashing","score":0.31508979201316833},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07684418559074402}],"concepts":[{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.8145188093185425},{"id":"https://openalex.org/C116058348","wikidata":"https://www.wikidata.org/wiki/Q846912","display_name":"Universal hashing","level":5,"score":0.6773695945739746},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6553239822387695},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6282875537872314},{"id":"https://openalex.org/C187062812","wikidata":"https://www.wikidata.org/wiki/Q6322840","display_name":"K-independent hashing","level":5,"score":0.5957877039909363},{"id":"https://openalex.org/C122907437","wikidata":"https://www.wikidata.org/wiki/Q5318999","display_name":"Dynamic perfect hashing","level":5,"score":0.5848469138145447},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5310400128364563},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.5039834380149841},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4835750460624695},{"id":"https://openalex.org/C7720571","wikidata":"https://www.wikidata.org/wiki/Q1136880","display_name":"Power of two","level":2,"score":0.4393324553966522},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4314681589603424},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38299453258514404},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.369914174079895},{"id":"https://openalex.org/C87431388","wikidata":"https://www.wikidata.org/wiki/Q2070573","display_name":"Perfect hash function","level":4,"score":0.36021536588668823},{"id":"https://openalex.org/C138111711","wikidata":"https://www.wikidata.org/wiki/Q478351","display_name":"Double hashing","level":4,"score":0.31508979201316833},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07684418559074402},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1993636.1993638","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1993636.1993638","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993638","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/1993636.1993638","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1993636.1993638","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993638","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2014586253.pdf","grobid_xml":"https://content.openalex.org/works/W2014586253.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W25594804","https://openalex.org/W200648432","https://openalex.org/W1514336682","https://openalex.org/W1546441687","https://openalex.org/W1551533237","https://openalex.org/W1795239726","https://openalex.org/W1851100088","https://openalex.org/W1970309382","https://openalex.org/W1979795732","https://openalex.org/W1982689753","https://openalex.org/W1993091968","https://openalex.org/W2026784425","https://openalex.org/W2039852170","https://openalex.org/W2052207834","https://openalex.org/W2059271645","https://openalex.org/W2063844956","https://openalex.org/W2071179368","https://openalex.org/W2107371087","https://openalex.org/W2144399314","https://openalex.org/W2295428206","https://openalex.org/W2325921940","https://openalex.org/W2338671350"],"related_works":["https://openalex.org/W2094127768","https://openalex.org/W2008159385","https://openalex.org/W1481411695","https://openalex.org/W1967593546","https://openalex.org/W2149451994","https://openalex.org/W2084899141","https://openalex.org/W2164322063","https://openalex.org/W2011732014","https://openalex.org/W2072057882","https://openalex.org/W3147234119"],"abstract_inverted_index":{"Randomized":[0],"algorithms":[1],"are":[2,19,49],"often":[3,20],"enjoyed":[4],"for":[5],"their":[6],"simplicity,":[7],"but":[8],"the":[9,15,29],"hash":[10,67],"functions":[11],"used":[12],"to":[13,43,65,76],"yield":[14],"desired":[16],"theoretical":[17],"guarantees":[18],"neither":[21],"simple":[22],"nor":[23],"practical.":[24],"Here":[25],"we":[26],"show":[27],"that":[28],"simplest":[30],"possible":[31],"tabulation":[32],"hashing":[33],"provides":[34],"unexpectedly":[35],"strong":[36],"guarantees.":[37],"The":[38],"scheme":[39],"itself":[40],"dates":[41],"back":[42],"Carter":[44],"and":[45],"Wegman":[46],"(STOC'77).":[47],"Keys":[48],"viewed":[50],"as":[51],"consisting":[52],"of":[53],"c":[54,58],"characters.":[55],"We":[56],"initialize":[57],"tables":[59],"T_1,":[60],"...,":[61,72],"T_c":[62],"mapping":[63],"characters":[64],"random":[66],"codes.":[68],"A":[69],"key":[70],"x=(x_1,":[71],"x_c)":[73],"is":[74],"hashed":[75],"T_1[x_1]":[77],"xor":[78,80],"...":[79],"T_c[x_c].":[81]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":14}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}