{"id":"https://openalex.org/W2008159385","doi":"https://doi.org/10.1137/060658400","title":"Uniform Hashing in Constant Time and Optimal Space","display_name":"Uniform Hashing in Constant Time and Optimal Space","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2008159385","doi":"https://doi.org/10.1137/060658400","mag":"2008159385"},"language":"en","primary_location":{"id":"doi:10.1137/060658400","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060658400","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"],"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/A5085243083","display_name":"Anna Pagh","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Anna Pagh","raw_affiliation_strings":["annao@itu.dk and pagh@itu.dk#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"annao@itu.dk and pagh@itu.dk#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014293815","display_name":"Rasmus Pagh","orcid":"https://orcid.org/0000-0002-1516-9306"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rasmus Pagh","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5085243083"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.0507,"has_fulltext":false,"cited_by_count":89,"citation_normalized_percentile":{"value":0.96498208,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"38","issue":"1","first_page":"85","last_page":"96"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983999729156494,"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/T11130","display_name":"Coding theory and cryptography","score":0.996999979019165,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dynamic-perfect-hashing","display_name":"Dynamic perfect hashing","score":0.8654959201812744},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.807447612285614},{"id":"https://openalex.org/keywords/universal-hashing","display_name":"Universal hashing","score":0.8023499846458435},{"id":"https://openalex.org/keywords/k-independent-hashing","display_name":"K-independent hashing","score":0.7942065596580505},{"id":"https://openalex.org/keywords/double-hashing","display_name":"Double hashing","score":0.7469239234924316},{"id":"https://openalex.org/keywords/perfect-hash-function","display_name":"Perfect hash function","score":0.7131456732749939},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5662726759910583},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5581496357917786},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5274301171302795},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.5134340524673462},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.5087140202522278},{"id":"https://openalex.org/keywords/linear-hashing","display_name":"Linear hashing","score":0.4929685592651367},{"id":"https://openalex.org/keywords/rolling-hash","display_name":"Rolling hash","score":0.49072253704071045},{"id":"https://openalex.org/keywords/ideal","display_name":"Ideal (ethics)","score":0.47655633091926575},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4739687144756317},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45344266295433044},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36163902282714844},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08401849865913391},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.055006831884384155},{"id":"https://openalex.org/keywords/quantum-mechanics","display_name":"Quantum mechanics","score":0.054492026567459106}],"concepts":[{"id":"https://openalex.org/C122907437","wikidata":"https://www.wikidata.org/wiki/Q5318999","display_name":"Dynamic perfect hashing","level":5,"score":0.8654959201812744},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.807447612285614},{"id":"https://openalex.org/C116058348","wikidata":"https://www.wikidata.org/wiki/Q846912","display_name":"Universal hashing","level":5,"score":0.8023499846458435},{"id":"https://openalex.org/C187062812","wikidata":"https://www.wikidata.org/wiki/Q6322840","display_name":"K-independent hashing","level":5,"score":0.7942065596580505},{"id":"https://openalex.org/C138111711","wikidata":"https://www.wikidata.org/wiki/Q478351","display_name":"Double hashing","level":4,"score":0.7469239234924316},{"id":"https://openalex.org/C87431388","wikidata":"https://www.wikidata.org/wiki/Q2070573","display_name":"Perfect hash function","level":4,"score":0.7131456732749939},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5662726759910583},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5581496357917786},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5274301171302795},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.5134340524673462},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.5087140202522278},{"id":"https://openalex.org/C36375716","wikidata":"https://www.wikidata.org/wiki/Q6553456","display_name":"Linear hashing","level":5,"score":0.4929685592651367},{"id":"https://openalex.org/C108546238","wikidata":"https://www.wikidata.org/wiki/Q4228982","display_name":"Rolling hash","level":5,"score":0.49072253704071045},{"id":"https://openalex.org/C2776639384","wikidata":"https://www.wikidata.org/wiki/Q840396","display_name":"Ideal (ethics)","level":2,"score":0.47655633091926575},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4739687144756317},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45344266295433044},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36163902282714844},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08401849865913391},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.055006831884384155},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.054492026567459106},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/060658400","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060658400","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:pure.atira.dk:publications/2047e110-8fbf-11dd-8006-000ea68e967b","is_oa":false,"landing_page_url":"https://pure.itu.dk/portal/da/publications/2047e110-8fbf-11dd-8006-000ea68e967b","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Pagh, A \u00d6 & Pagh, R 2008, 'Uniform Hashing in Constant Time and Optimal Space', SIAM Journal on Computing, vol. 38, no. 1, pp. 85-96. https://doi.org/10.1137/060658400","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W21386869","https://openalex.org/W23327207","https://openalex.org/W98016092","https://openalex.org/W1489218338","https://openalex.org/W1546441687","https://openalex.org/W1585070348","https://openalex.org/W1600795850","https://openalex.org/W1631603072","https://openalex.org/W1781587470","https://openalex.org/W1964089073","https://openalex.org/W1985623009","https://openalex.org/W1991107293","https://openalex.org/W2052207834","https://openalex.org/W2059271645","https://openalex.org/W2061468734","https://openalex.org/W2063844956","https://openalex.org/W2071179368","https://openalex.org/W2159341052","https://openalex.org/W2164322063","https://openalex.org/W2165621523","https://openalex.org/W2393403542","https://openalex.org/W2912437396","https://openalex.org/W2912601938","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2084899141","https://openalex.org/W2094127768","https://openalex.org/W1481411695","https://openalex.org/W2164322063","https://openalex.org/W1551533237","https://openalex.org/W2008159385","https://openalex.org/W4251536634","https://openalex.org/W2333289748","https://openalex.org/W2267172249","https://openalex.org/W2943258916"],"abstract_inverted_index":{"Many":[0],"algorithms":[1],"and":[2,58,106],"data":[3],"structures":[4],"employing":[5],"hashing":[6,13,137,149],"have":[7,36],"been":[8],"analyzed":[9],"under":[10],"the":[11,16,28,131,141],"uniform":[12,148],"assumption,":[14],"i.e.,":[15],"assumption":[17],"that":[18,50,145],"hash":[19,32,48,76,143],"functions":[20,49],"behave":[21],"like":[22,89],"truly":[23,91],"random":[24,92],"functions.":[25],"Starting":[26],"with":[27,94,153],"discovery":[29],"of":[30,85],"universal":[31],"functions,":[33],"many":[34,136],"researchers":[35],"studied":[37],"to":[38,72,122],"what":[39],"extent":[40],"this":[41,64,73,128,139],"theoretical":[42],"ideal":[43,70],"can":[44,59,97,107,119],"be":[45,60,98,108,120,123],"realized":[46],"by":[47],"do":[51],"not":[52],"take":[53],"up":[54],"too":[55],"much":[56],"space":[57],"evaluated":[61,99],"quickly.":[62],"In":[63],"paper":[65],"we":[66],"present":[67],"an":[68],"almost":[69],"solution":[71],"problem:":[74],"a":[75,90,104],"function":[77,93,144],"$h:":[78],"U\\rightarrow":[79],"V$":[80],"that,":[81],"on":[82,103],"any":[83,124],"set":[84],"n":[86],"inputs,":[87],"behaves":[88],"high":[95,154],"probability,":[96,155],"in":[100,110,159],"constant":[101],"time":[102,160],"RAM":[105],"stored":[109],"$(1+\\epsilon)n\\log":[111],"|V|":[112],"+":[113],"O(n+\\log\\log":[114],"|U|)$":[115],"bits.":[116],"Here":[117],"$\\epsilon$":[118],"chosen":[121],"positive":[125],"constant,":[126],"so":[127],"essentially":[129],"matches":[130],"entropy":[132],"lower":[133],"bound.":[134],"For":[135],"schemes":[138],"is":[140],"first":[142],"makes":[146],"their":[147],"analysis":[150],"come":[151],"true,":[152],"without":[156],"incurring":[157],"overhead":[158],"or":[161],"space.":[162]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":14},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":3}],"updated_date":"2026-05-13T08:25:38.343686","created_date":"2025-10-10T00:00:00"}