{"id":"W2150574820","doi":"10.1093/comjnl/bxt070","title":"Strongly Universal String Hashing is Fast","year":2013,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick; Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hash function; Computer science; Parallel computing; Byte; Dynamic perfect hashing; String (physics); Universal hashing; Theoretical computer science; Arithmetic; Double hashing; Hash table; Mathematics; Programming language","routes":{"ca_aff":true,"ca_fund":true,"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.003129991,0.0007675854,0.001143807,0.001335466,0.001481905,0.001946773,0.001291709,0.001235187,0.005397362],"category_scores_gemma":[0.01568529,0.0009167677,0.001041351,0.001657899,0.003151839,0.008359399,0.005348,0.002048469,0.002212832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009177064,"about_ca_system_score_gemma":0.00142388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004123879,"about_ca_topic_score_gemma":0.0003470936,"domain_scores_codex":[0.9965251,0.0006539154,0.0002238329,0.0006121811,0.001475572,0.0005094032],"domain_scores_gemma":[0.9859471,0.005671556,0.0009324611,0.004992083,0.002130494,0.0003261539],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001105362,0.0002053768,0.00437996,0.0007962561,0.0001238093,0.0003755199,0.0008112245,0.03070395,0.03865829,0.5924414,0.01633555,0.3140632],"study_design_scores_gemma":[0.0001555557,0.000692635,0.001721253,0.0002023793,0.0001707803,0.001441933,0.000263512,0.1954061,0.09258739,0.6660937,0.04107594,0.0001887349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1475542,0.002541016,0.8121847,0.001567573,0.0004000244,0.0002223143,0.0004340022,0.006501038,0.02859512],"genre_scores_gemma":[0.8498017,0.001089434,0.1367737,0.001079312,0.0005077657,0.0003167949,0.0005537298,0.001039667,0.008837841],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005397362,"threshold_uncertainty_score":0.01805592,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01313695057224418,"score_gpt":0.2130234500110486,"score_spread":0.1998864994388044,"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."}}