{"id":"https://openalex.org/W2050309875","doi":"https://doi.org/10.1137/090770928","title":"An Analysis of Random-Walk Cuckoo Hashing","display_name":"An Analysis of Random-Walk Cuckoo Hashing","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2050309875","doi":"https://doi.org/10.1137/090770928","mag":"2050309875"},"language":"en","primary_location":{"id":"doi:10.1137/090770928","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090770928","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/journal_contribution/An_Analysis_of_Random-Walk_Cuckoo_Hashing/6476774","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056950019","display_name":"Alan Frieze","orcid":"https://orcid.org/0000-0002-8481-5615"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alan Frieze","raw_affiliation_strings":["alan@random.math.cmu.edu and pmelsted@gmail.com#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"alan@random.math.cmu.edu and pmelsted@gmail.com#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018556494","display_name":"P\u00e1ll Melsted","orcid":"https://orcid.org/0000-0002-8418-6724"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P\u00e1ll Melsted","raw_affiliation_strings":["Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062318856","display_name":"Michael Mitzenmacher","orcid":"https://orcid.org/0000-0001-5430-5457"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Mitzenmacher","raw_affiliation_strings":["michaelm@eecs.harvard.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"michaelm@eecs.harvard.edu#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.6379,"has_fulltext":true,"cited_by_count":31,"citation_normalized_percentile":{"value":0.90612712,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"40","issue":"2","first_page":"291","last_page":"308"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.998199999332428,"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.998199999332428,"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/T11017","display_name":"Chaos-based Image/Signal Encryption","score":0.9972000122070312,"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/T11241","display_name":"Advanced Malware Detection Techniques","score":0.9884999990463257,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dynamic-perfect-hashing","display_name":"Dynamic perfect hashing","score":0.8003672957420349},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.6978757977485657},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6825705766677856},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.6491973400115967},{"id":"https://openalex.org/keywords/k-independent-hashing","display_name":"K-independent hashing","score":0.6208131313323975},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.6000576615333557},{"id":"https://openalex.org/keywords/universal-hashing","display_name":"Universal hashing","score":0.5122703909873962},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.500011682510376},{"id":"https://openalex.org/keywords/linear-hashing","display_name":"Linear hashing","score":0.49453970789909363},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46896636486053467},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40329328179359436},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3804410696029663},{"id":"https://openalex.org/keywords/perfect-hash-function","display_name":"Perfect hash function","score":0.34849247336387634},{"id":"https://openalex.org/keywords/double-hashing","display_name":"Double hashing","score":0.28679928183555603},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.17180341482162476},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.06146824359893799}],"concepts":[{"id":"https://openalex.org/C122907437","wikidata":"https://www.wikidata.org/wiki/Q5318999","display_name":"Dynamic perfect hashing","level":5,"score":0.8003672957420349},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.6978757977485657},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6825705766677856},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.6491973400115967},{"id":"https://openalex.org/C187062812","wikidata":"https://www.wikidata.org/wiki/Q6322840","display_name":"K-independent hashing","level":5,"score":0.6208131313323975},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.6000576615333557},{"id":"https://openalex.org/C116058348","wikidata":"https://www.wikidata.org/wiki/Q846912","display_name":"Universal hashing","level":5,"score":0.5122703909873962},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.500011682510376},{"id":"https://openalex.org/C36375716","wikidata":"https://www.wikidata.org/wiki/Q6553456","display_name":"Linear hashing","level":5,"score":0.49453970789909363},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46896636486053467},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40329328179359436},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3804410696029663},{"id":"https://openalex.org/C87431388","wikidata":"https://www.wikidata.org/wiki/Q2070573","display_name":"Perfect hash function","level":4,"score":0.34849247336387634},{"id":"https://openalex.org/C138111711","wikidata":"https://www.wikidata.org/wiki/Q478351","display_name":"Double hashing","level":4,"score":0.28679928183555603},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.17180341482162476},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.06146824359893799},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.1137/090770928","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090770928","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:figshare.com:article/6476774","is_oa":true,"landing_page_url":null,"pdf_url":"https://figshare.com/articles/journal_contribution/An_Analysis_of_Random-Walk_Cuckoo_Hashing/6476774","source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:repository.cmu.edu:math-1794","is_oa":false,"landing_page_url":"http://repository.cmu.edu/math/791","pdf_url":null,"source":{"id":"https://openalex.org/S4306400668","display_name":"Research Showcase @ Carnegie Mellon University (Carnegie Mellon University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Mathematical Sciences","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.149.9845","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.149.9845","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.cmu.edu/~pmelsted/papers/cuckoo.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.150.392","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.392","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.cmu.edu/~af1p/Texfiles/cuckoo.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.216.1395","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.216.1395","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.cmu.edu/%7Eaf1p/Texfiles/cuckoo.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.422.689","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.422.689","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.harvard.edu/~michaelm/postscripts/RANDOM-CUCKOO.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.422.900","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.422.900","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.harvard.edu/~michaelm/postscripts/rand09.pdf","raw_type":"text"},{"id":"doi:10.1184/r1/6476774.v1","is_oa":true,"landing_page_url":"https://doi.org/10.1184/r1/6476774.v1","pdf_url":null,"source":{"id":"https://openalex.org/S7407050927","display_name":"KiltHub Repository","issn_l":null,"issn":[],"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":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/6476774","is_oa":true,"landing_page_url":null,"pdf_url":"https://figshare.com/articles/journal_contribution/An_Analysis_of_Random-Walk_Cuckoo_Hashing/6476774","source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.46000000834465027,"id":"https://metadata.un.org/sdg/11"}],"awards":[{"id":"https://openalex.org/G3491258566","display_name":"Probabilistic Considerations in the Analysis of Algorithms","funder_award_id":"0502793","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8373184690","display_name":"NeTS FIND:  A Network-Wide Hashing Infrastructure for Monitoring and Measurement","funder_award_id":"0721491","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320307791","display_name":"Cisco Systems","ror":"https://ror.org/03yt1ez60"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2050309875.pdf","grobid_xml":"https://content.openalex.org/works/W2050309875.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W52628824","https://openalex.org/W62758726","https://openalex.org/W1945549020","https://openalex.org/W1979795732","https://openalex.org/W1980088630","https://openalex.org/W2040401241","https://openalex.org/W2048541619","https://openalex.org/W2061468734","https://openalex.org/W2114471387","https://openalex.org/W2136399778","https://openalex.org/W2166542473","https://openalex.org/W2912437396","https://openalex.org/W2912601938"],"related_works":["https://openalex.org/W2084899141","https://openalex.org/W2094127768","https://openalex.org/W1481411695","https://openalex.org/W2164322063","https://openalex.org/W2008159385","https://openalex.org/W1551533237","https://openalex.org/W1486630602","https://openalex.org/W1967593546","https://openalex.org/W102859714","https://openalex.org/W2149451994"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,127],"provide":[4],"a":[5,28,101,137,160],"polylogarithmic":[6,138],"bound":[7,104,139],"that":[8,50,109,140],"holds":[9,110,141],"with":[10,58,111,142],"high":[11,112,143],"probability":[12,144],"on":[13,75,105,145],"the":[14,21,46,59,64,76,79,106,115,130,133,146],"insertion":[15,23,107,124],"time":[16,108],"for":[17,31,55,163],"cuckoo":[18,41],"hashing":[19,26,42],"under":[20],"random-walk":[22,149],"method.":[24],"Cuckoo":[25],"provides":[27],"useful":[29],"methodology":[30],"building":[32],"practical,":[33],"high-performance":[34],"hash":[35,53],"tables.":[36],"The":[37],"essential":[38],"idea":[39],"of":[40,48,66,81,132],"is":[43,83,92,166],"to":[44,61],"combine":[45],"power":[47,60],"schemes":[49],"allow":[51],"multiple":[52],"locations":[54],"an":[56,67,164],"item":[57,68,165],"dynamically":[62],"change":[63],"location":[65,162],"among":[69],"its":[70],"possible":[71],"locations.":[72],"Previous":[73],"work":[74],"case":[77],"where":[78,151],"number":[80],"choices":[82],"larger":[84],"than":[85],"two":[86],"has":[87,99],"analyzed":[88],"breadth-first":[89],"search,":[90],"which":[91],"both":[93],"inefficient":[94],"in":[95],"practice":[96],"and":[97],"currently":[98],"only":[100],"polynomial":[102],"upper":[103],"probability.":[113],"On":[114],"other":[116],"hand,":[117],"it":[118],"does":[119],"have":[120],"expected":[121],"constant":[122],"amortized":[123],"time.":[125],"Here":[126],"significantly":[128],"advance":[129],"state":[131],"art":[134],"by":[135],"proving":[136],"more":[147],"efficient":[148],"method,":[150],"items":[152,158],"repeatedly":[153],"kick":[154],"out":[155],"random":[156],"blocking":[157],"until":[159],"free":[161],"found.":[167]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}