{"id":"W2109929425","doi":"10.82308/45910","title":"Two-way hashing with separate chaining and linear probing","year":2004,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Chaining; Hash function; Dynamic perfect hashing; Combinatorics; Hash table; K-independent hashing; Bounded function; Mathematics; Linear hashing; Asymptotically optimal algorithm; Perfect hash function; Discrete mathematics; Binary logarithm; Constant (computer programming); Computer science; Double hashing; Algorithm","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.003283396,0.001088426,0.00161603,0.001048639,0.001083818,0.001924259,0.003980419,0.002109593,0.002913297],"category_scores_gemma":[0.01642727,0.001132243,0.001266765,0.002234895,0.002849809,0.01026941,0.007579698,0.002366802,0.001204277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001634749,"about_ca_system_score_gemma":0.001610807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008649597,"about_ca_topic_score_gemma":0.0006363762,"domain_scores_codex":[0.9948042,0.001417181,0.000362034,0.001052454,0.00166243,0.0007017016],"domain_scores_gemma":[0.9840756,0.006325983,0.001206597,0.006810299,0.001150423,0.0004310532],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001781929,0.0007282677,0.00873188,0.00080477,0.0001857618,0.0005052415,0.0007356378,0.426659,0.05353693,0.2923111,0.004357498,0.2096621],"study_design_scores_gemma":[0.00007625757,0.0002816795,0.0003198587,0.00001775501,0.00002122272,0.0003204925,0.00003867993,0.9501259,0.01042919,0.03662838,0.001689365,0.00005138621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04213191,0.0003591082,0.9533126,0.000230795,0.00003613048,0.0002453438,0.00007611487,0.0009417986,0.002666273],"genre_scores_gemma":[0.703639,0.0002625936,0.2900906,0.0002100502,0.00008400712,0.0005511928,0.0002779793,0.0001327377,0.004751794],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003980419,"threshold_uncertainty_score":0.01736444,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01797479363825379,"score_gpt":0.2367267808159922,"score_spread":0.2187519871777384,"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."}}