{"id":"W2149356828","doi":"10.1007/s00453-013-9840-x","title":"Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Universal hashing; Dynamic perfect hashing; K-independent hashing; Double hashing; Hash function; Perfect hash function; Computer science; Hash table; Mathematical proof; Constant (computer programming); Theoretical computer science; Theory of computation; Mathematics; Discrete mathematics; Combinatorics; Algorithm; Programming language","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002358699,0.001047665,0.001854447,0.001142207,0.002923496,0.00327844,0.001856999,0.004254165,0.01099868],"category_scores_gemma":[0.02300206,0.001225405,0.001203664,0.00220873,0.004557383,0.01469184,0.006028074,0.0042987,0.004670063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001082846,"about_ca_system_score_gemma":0.001954133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003809994,"about_ca_topic_score_gemma":0.0006201471,"domain_scores_codex":[0.996787,0.0006664631,0.0002301428,0.0005620013,0.001194304,0.0005601589],"domain_scores_gemma":[0.9838612,0.004448876,0.0006067375,0.009431172,0.001349082,0.000302887],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009198595,0.0001964842,0.00162184,0.0004072609,0.00006708373,0.0003493383,0.0005210566,0.02217991,0.009322865,0.8771643,0.009520129,0.0777299],"study_design_scores_gemma":[0.0001098408,0.0001377223,0.0003258013,0.00008548956,0.00004415696,0.0004852292,0.0001491131,0.05999261,0.009737597,0.9167967,0.01205961,0.00007618754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08477406,0.001015023,0.8820239,0.001843263,0.0004754684,0.0003665214,0.0007605405,0.00217055,0.02657079],"genre_scores_gemma":[0.8583038,0.0006653515,0.119687,0.0008829555,0.000427366,0.0004791661,0.0009352553,0.0007738041,0.01784534],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01099868,"threshold_uncertainty_score":0.03679419,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007133839550742515,"score_gpt":0.2025470687718831,"score_spread":0.1954132292211405,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}