{"id":"https://openalex.org/W2728476733","doi":"https://doi.org/10.1145/3068772","title":"Fast and powerful hashing using tabulation","display_name":"Fast and powerful hashing using tabulation","publication_year":2017,"publication_date":"2017-06-26","ids":{"openalex":"https://openalex.org/W2728476733","doi":"https://doi.org/10.1145/3068772","mag":"2728476733"},"language":"en","primary_location":{"id":"doi:10.1145/3068772","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3068772","pdf_url":null,"source":{"id":"https://openalex.org/S103482838","display_name":"Communications of the ACM","issn_l":"0001-0782","issn":["0001-0782","1557-7317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://curis.ku.dk/portal/da/publications/fast-and-powerful-hashing-using-tabulation(a1f91d2b-0afc-44c7-9a09-7482f8213cb5).html","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039232562","display_name":"Mikkel Thorup","orcid":"https://orcid.org/0000-0001-5237-1709"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Mikkel Thorup","raw_affiliation_strings":["University of Copenhagen, Denmark"],"affiliations":[{"raw_affiliation_string":"University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5039232562"],"corresponding_institution_ids":["https://openalex.org/I124055696"],"apc_list":null,"apc_paid":null,"fwci":0.6232,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.76671258,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"60","issue":"7","first_page":"94","last_page":"101"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9997000098228455,"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.9997000098228455,"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.9991000294685364,"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/T11017","display_name":"Chaos-based Image/Signal Encryption","score":0.9887999892234802,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6511726975440979},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.35992926359176636}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6511726975440979},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.35992926359176636}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3068772","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3068772","pdf_url":null,"source":{"id":"https://openalex.org/S103482838","display_name":"Communications of the ACM","issn_l":"0001-0782","issn":["0001-0782","1557-7317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/a1f91d2b-0afc-44c7-9a09-7482f8213cb5","is_oa":true,"landing_page_url":"https://curis.ku.dk/portal/da/publications/fast-and-powerful-hashing-using-tabulation(a1f91d2b-0afc-44c7-9a09-7482f8213cb5).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/d87491d9-6ef9-480f-bcbb-2f58483aba6b","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/d87491d9-6ef9-480f-bcbb-2f58483aba6b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Thorup , M 2017 , ' Fast and powerful hashing using tabulation ' , Communications of the ACM , vol. 60 , no. 7 , pp. 94-101 . https://doi.org/10.1145/3068772","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/a1f91d2b-0afc-44c7-9a09-7482f8213cb5","is_oa":true,"landing_page_url":"https://curis.ku.dk/portal/da/publications/fast-and-powerful-hashing-using-tabulation(a1f91d2b-0afc-44c7-9a09-7482f8213cb5).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W190065572","https://openalex.org/W1520833380","https://openalex.org/W1569258476","https://openalex.org/W1583926005","https://openalex.org/W1795239726","https://openalex.org/W1851100088","https://openalex.org/W1979795732","https://openalex.org/W1982689753","https://openalex.org/W1993091968","https://openalex.org/W2003184432","https://openalex.org/W2008159385","https://openalex.org/W2009316475","https://openalex.org/W2025051251","https://openalex.org/W2037633400","https://openalex.org/W2052207834","https://openalex.org/W2063844956","https://openalex.org/W2071179368","https://openalex.org/W2080745194","https://openalex.org/W2081193615","https://openalex.org/W2107371087","https://openalex.org/W2129930407","https://openalex.org/W2147017814","https://openalex.org/W2169660454","https://openalex.org/W2295428206","https://openalex.org/W2408675303","https://openalex.org/W2912437396","https://openalex.org/W2912601938","https://openalex.org/W4231916799","https://openalex.org/W4246180860"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":{"Randomized":[0],"algorithms":[1,223],"are":[2,19,69,158,304],"often":[3,20],"enjoyed":[4],"for":[5,56,164,202,219,265,295],"their":[6,311],"simplicity,":[7],"but":[8],"the":[9,15,155,241,244,255,275],"hash":[10,94,188],"functions":[11],"employed":[12],"to":[13,23,48,92,112,240,272,307],"yield":[14],"desired":[16],"probabilistic":[17],"guarantees":[18,156],"too":[21],"complicated":[22],"be":[24],"practical.":[25],"Here,":[26],"we":[27,77,172,227,232],"survey":[28],"recent":[29],"results":[30],"on":[31,37],"how":[32],"simple":[33,144,184,235],"hashing":[34,45,52],"schemes":[35,134,291,303],"based":[36],"tabulation":[38,44,145,175,230,236,279,290,302],"provide":[39,152],"unexpectedly":[40],"strong":[41],"guarantees.":[42],"Simple":[43],"dates":[46],"back":[47],"Zobrist":[49],"(A":[50],"new":[51],"method":[53],"with":[54,138],"application":[55],"game":[57],"playing.":[58],"Technical":[59],"Report":[60],"88,":[61],"Computer":[62],"Sciences":[63],"Department,":[64],"University":[65],"of":[66,73,154,243,258,269,274],"Wisconsin).":[67],"Keys":[68],"viewed":[70],"as":[71],"consisting":[72],"c":[74,89,108,128,131],"characters":[75,91],"and":[76,168,197,224,246,260,298,309],"have":[78],"precomputed":[79],"character":[80,139,179],"tables":[81,140],"h":[82,88,113,120,127],"1":[83,102,114,117],",":[84,103],".":[85,86,104,105],".,":[87,106],"mapping":[90],"random":[93,282],"values.":[95],"A":[96],"key":[97],"x":[98,101,107,116,123,130],"=":[99],"(":[100],")":[109],"is":[110,135,146,180,206,216,313],"hashed":[111],"[":[115,122,129],"]":[118,132],"\u2295":[119,126],"2":[121,124],"].....":[125],"This":[133,205],"very":[136,199,251],"fast":[137,211],"in":[141,182,254],"cache.":[142],"Although":[143,300],"not":[147],"even":[148],"four-independent,":[149],"it":[150],"does":[151],"many":[153,220],"that":[157,215,248,273],"normally":[159],"obtained":[160],"via":[161],"higher":[162],"independence,":[163],"example,":[165],"linear":[166],"probing":[167],"Cuckoo":[169],"hashing.":[170,204,283],"Next,":[171],"consider":[173,228],"twisted":[174],"where":[176,231],"one":[177,239],"input":[178],"\"twisted\"":[181],"a":[183,198,266],"way.":[185],"The":[186],"resulting":[187],"function":[189],"has":[190],"powerful":[191],"distributional":[192],"properties:":[193],"Chernoff-style":[194],"tail":[195],"bounds":[196],"small":[200],"bias":[201],"minwise":[203],"also":[207,285],"yields":[208,250],"an":[209],"extremely":[210],"pseudorandom":[212],"number":[213],"generator":[214],"provably":[217],"good":[218],"classic":[221,256],"randomized":[222],"data-structures.":[225],"Finally,":[226],"double":[229,278],"compose":[233],"two":[234],"functions,":[237],"applying":[238],"output":[242],"other,":[245],"show":[247],"this":[249],"high":[252],"independence":[253,294],"framework":[257],"Wegman":[259],"Carter.":[261],"In":[262],"fact,":[263],"w.h.p.,":[264],"given":[267,296],"set":[268],"size":[270],"proportional":[271],"space":[276],"consumed,":[277],"gives":[280],"fully":[281],"We":[284],"mention":[286],"some":[287],"more":[288],"elaborate":[289],"getting":[292],"near-optimal":[293],"time":[297],"space.":[299],"these":[301],"all":[305],"easy":[306],"implement":[308],"use,":[310],"analysis":[312],"not.":[314]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-17T09:09:15.849793","created_date":"2025-10-10T00:00:00"}