{"id":"W1979499253","doi":"","title":"Dynamic optimality for skip lists and B-trees","year":2008,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Upper and lower bounds; Binary tree; Computer science; Binary search tree; Tree (set theory); Set (abstract data type); Weight-balanced tree; Branching (polymer chemistry); Combinatorics; Class (philosophy); Sequence (biology); Optimal binary search tree; Context (archaeology); Search tree; Ternary search tree; Binary number; Binary decision diagram; Discrete mathematics; Theoretical computer science; Mathematics; Interval tree; Algorithm; Search algorithm; Tree structure; Arithmetic; Artificial intelligence","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.00155479,0.0005319803,0.0008746723,0.001145972,0.001075524,0.002197791,0.00153614,0.001185554,0.007041266],"category_scores_gemma":[0.01111868,0.0005734261,0.0006697525,0.001996355,0.001303798,0.005881113,0.002034072,0.001934422,0.001466352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001493386,"about_ca_system_score_gemma":0.001142201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001446369,"about_ca_topic_score_gemma":0.001612246,"domain_scores_codex":[0.9986078,0.0002472292,0.0001058453,0.0002903891,0.000475469,0.0002732906],"domain_scores_gemma":[0.9954104,0.002744874,0.0003683497,0.0008227515,0.000445821,0.0002078837],"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.0004570616,0.0001805068,0.002130619,0.0003413281,0.0000438308,0.0001103164,0.0003423314,0.1272874,0.01342777,0.7263374,0.00854112,0.1208003],"study_design_scores_gemma":[0.00004690151,0.0001309701,0.0006500589,0.00006038699,0.00002711698,0.0001479569,0.00008828058,0.292903,0.007024364,0.6897675,0.009122677,0.00003079014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1663584,0.001484067,0.8059504,0.0009675199,0.00007509875,0.00009754379,0.0007725506,0.001209116,0.02308538],"genre_scores_gemma":[0.5830116,0.00138732,0.402302,0.0004863337,0.0001529386,0.0003596942,0.00148214,0.0008473013,0.009970571],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007041266,"threshold_uncertainty_score":0.0235554,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02942393810886324,"score_gpt":0.2859440844393497,"score_spread":0.2565201463304865,"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."}}