{"id":"W1480201994","doi":"10.1007/978-3-642-17517-6_12","title":"Should Static Search Trees Ever Be Unbalanced?","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Tree (set theory); Computer science; Search tree; R-tree; Binary logarithm; Optimal binary search tree; K-ary tree; Running time; Combinatorics; Tree structure; Algorithm; Mathematics; Search algorithm; Interval tree; Binary tree; Statistics","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.002290862,0.0005365044,0.0007851825,0.0008358426,0.001195723,0.002022132,0.001427444,0.002025239,0.01575293],"category_scores_gemma":[0.0392569,0.0006678817,0.0002733709,0.002155261,0.001896832,0.01352063,0.001639272,0.001825045,0.007559125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008605759,"about_ca_system_score_gemma":0.0009709061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009888159,"about_ca_topic_score_gemma":0.001959413,"domain_scores_codex":[0.998467,0.0002861606,0.00008399358,0.0002629566,0.0006441968,0.0002556287],"domain_scores_gemma":[0.988079,0.005817211,0.0006327695,0.003077023,0.001999246,0.0003947582],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005792763,0.00008346468,0.003237044,0.0004239248,0.00003915703,0.0003611127,0.0004568529,0.008654671,0.007181402,0.365508,0.1521667,0.4613083],"study_design_scores_gemma":[0.00006482226,0.00008271765,0.0009496907,0.0002309761,0.00004943293,0.0008165235,0.000379791,0.02679918,0.007383067,0.7686347,0.1945708,0.00003820594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1206738,0.01212912,0.6011597,0.06490701,0.008242345,0.0001974328,0.003046501,0.009022164,0.180622],"genre_scores_gemma":[0.6619639,0.007271592,0.2351598,0.01322305,0.003916855,0.0002789979,0.003736106,0.004742709,0.06970706],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01575293,"threshold_uncertainty_score":0.05269885,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03550106160354684,"score_gpt":0.288388382224733,"score_spread":0.2528873206211862,"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."}}