{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0008133467,0.0004070908,0.0003576673,0.0001852378,0.001434555,0.0003397846,0.0008966123,0.0001285534,0.0000089893],"category_scores_gemma":[0.00009013955,0.0003403197,0.0000655859,0.0005832731,0.0000835922,0.00310221,0.0009415285,0.0007008185,0.00006824537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002079381,"about_ca_system_score_gemma":0.00004851454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002270588,"about_ca_topic_score_gemma":0.00007043579,"domain_scores_codex":[0.9972215,0.0001223944,0.0003982833,0.001031935,0.0005388678,0.0006870704],"domain_scores_gemma":[0.9983409,0.0000961957,0.0002247397,0.000841714,0.0001447017,0.0003517297],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00007758434,0.0002127566,0.000156805,0.00008721645,0.0001021796,0.0004673751,0.0001063826,0.008463317,0.04129684,0.6270052,0.000001707076,0.3220226],"study_design_scores_gemma":[0.02806815,0.003636256,0.003512713,0.005540291,0.0002695267,0.003581571,0.0007486976,0.1516046,0.4516879,0.2048418,0.13724,0.009268471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9826996,0.0002134983,0.005347095,0.0001425465,0.0003740831,0.0004602878,0.00008763031,0.0006945638,0.009980649],"genre_scores_gemma":[0.8663029,0.00002915134,0.1330007,0.0004016896,0.00004641709,0.00002821186,0.00001394443,0.00004737884,0.0001296122],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4221634,"threshold_uncertainty_score":0.9999049,"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."}}