{"id":"https://openalex.org/W2031934066","doi":"https://doi.org/10.1016/0304-3975(93)90257-t","title":"The computational complexity of universal hashing","display_name":"The computational complexity of universal hashing","publication_year":1993,"publication_date":"1993-01-01","ids":{"openalex":"https://openalex.org/W2031934066","doi":"https://doi.org/10.1016/0304-3975(93)90257-t","mag":"2031934066"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(93)90257-t","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(93)90257-t","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5014637159","display_name":"Yishay Mansour","orcid":"https://orcid.org/0000-0001-6891-2645"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yishay Mansour","raw_affiliation_strings":["Laboratory for Computer Science, MIT, 545 Tech. Sq., Cambridge, MA 02139, USA"],"affiliations":[{"raw_affiliation_string":"Laboratory for Computer Science, MIT, 545 Tech. Sq., Cambridge, MA 02139, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081416898","display_name":"Noam Nisan","orcid":"https://orcid.org/0000-0003-3106-6304"},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Noam Nisan","raw_affiliation_strings":["Department of Computer Science, Hebrew University, Jerusalem, Israel","[Department of Computer Science, Hebrew University, Jerusalem, Israel]"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Hebrew University, Jerusalem, Israel","institution_ids":["https://openalex.org/I197251160"]},{"raw_affiliation_string":"[Department of Computer Science, Hebrew University, Jerusalem, Israel]","institution_ids":["https://openalex.org/I197251160"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100820614","display_name":"Prasoon Tiwari","orcid":null},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Prasoon Tiwari","raw_affiliation_strings":["Department of Computer Science, University of Wisconsin-Madison, 1210 W. Dayton Street, Madison, WI 53706. USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Wisconsin-Madison, 1210 W. Dayton Street, Madison, WI 53706. USA","institution_ids":["https://openalex.org/I135310074"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5014637159"],"corresponding_institution_ids":[],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":6.4014,"has_fulltext":false,"cited_by_count":133,"citation_normalized_percentile":{"value":0.96372128,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"107","issue":"1","first_page":"121","last_page":"133"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9980000257492065,"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"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9979000091552734,"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/corollary","display_name":"Corollary","score":0.6219914555549622},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.614050030708313},{"id":"https://openalex.org/keywords/universal-hashing","display_name":"Universal hashing","score":0.6078329682350159},{"id":"https://openalex.org/keywords/perfect-hash-function","display_name":"Perfect hash function","score":0.5829100608825684},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5418323874473572},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.5148133635520935},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.4985380172729492},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4935058355331421},{"id":"https://openalex.org/keywords/k-independent-hashing","display_name":"K-independent hashing","score":0.48905429244041443},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4533703327178955},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4505154490470886},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.44782862067222595},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.43924954533576965},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4355814456939697},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.427852600812912},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4000087082386017},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.35386136174201965},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2821395993232727},{"id":"https://openalex.org/keywords/double-hashing","display_name":"Double hashing","score":0.11384016275405884}],"concepts":[{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.6219914555549622},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.614050030708313},{"id":"https://openalex.org/C116058348","wikidata":"https://www.wikidata.org/wiki/Q846912","display_name":"Universal hashing","level":5,"score":0.6078329682350159},{"id":"https://openalex.org/C87431388","wikidata":"https://www.wikidata.org/wiki/Q2070573","display_name":"Perfect hash function","level":4,"score":0.5829100608825684},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5418323874473572},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.5148133635520935},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.4985380172729492},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4935058355331421},{"id":"https://openalex.org/C187062812","wikidata":"https://www.wikidata.org/wiki/Q6322840","display_name":"K-independent hashing","level":5,"score":0.48905429244041443},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4533703327178955},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4505154490470886},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.44782862067222595},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.43924954533576965},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4355814456939697},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.427852600812912},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4000087082386017},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.35386136174201965},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2821395993232727},{"id":"https://openalex.org/C138111711","wikidata":"https://www.wikidata.org/wiki/Q478351","display_name":"Double hashing","level":4,"score":0.11384016275405884},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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":1,"locations":[{"id":"doi:10.1016/0304-3975(93)90257-t","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(93)90257-t","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1552744309","https://openalex.org/W1585714998","https://openalex.org/W1974411071","https://openalex.org/W1976463987","https://openalex.org/W1982991092","https://openalex.org/W1984976620","https://openalex.org/W2009807436","https://openalex.org/W2038469103","https://openalex.org/W2048632752","https://openalex.org/W2052207834","https://openalex.org/W2052404100","https://openalex.org/W2056352038","https://openalex.org/W2066947547","https://openalex.org/W2070570981","https://openalex.org/W2091563557","https://openalex.org/W2110824700","https://openalex.org/W2120210041","https://openalex.org/W2121818942","https://openalex.org/W2129731249","https://openalex.org/W2131798840","https://openalex.org/W2398918824","https://openalex.org/W2798579874","https://openalex.org/W6634287997","https://openalex.org/W6634991769","https://openalex.org/W6643713069","https://openalex.org/W6646293328","https://openalex.org/W6659659214","https://openalex.org/W6660042686","https://openalex.org/W6662808833","https://openalex.org/W6676754117","https://openalex.org/W6677980218","https://openalex.org/W6679636167","https://openalex.org/W6737069133"],"related_works":["https://openalex.org/W2094127768","https://openalex.org/W2084899141","https://openalex.org/W2072057882","https://openalex.org/W102859714","https://openalex.org/W2149143947","https://openalex.org/W2740037903","https://openalex.org/W2912601938","https://openalex.org/W2728476733","https://openalex.org/W2333289748","https://openalex.org/W2267172249"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":5}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}