{"id":"W1793615280","doi":"10.1007/s00453-016-0224-x","title":"The Power and Limitations of Static Binary Search Trees with Lazy Finger","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Division of Computing and Communication Foundations; Center for Massive Data Algorithmics; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS","keywords":"Optimal binary search tree; Binary search tree; Binary tree; Random binary tree; Theory of computation; Mathematics; Tree (set theory); Self-balancing binary search tree; Search tree; Computer science; Algorithm; Entropy (arrow of time); Dynamic programming; Ternary search tree; K-ary tree; Combinatorics; Tree structure; Interval tree; Search algorithm","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.007773248,0.0006101424,0.001806827,0.001763992,0.001827779,0.004385564,0.003012713,0.002278171,0.006920649],"category_scores_gemma":[0.03532615,0.001114927,0.001017546,0.003215332,0.005807698,0.01613967,0.004100109,0.00312544,0.002058644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001298344,"about_ca_system_score_gemma":0.001961762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002133335,"about_ca_topic_score_gemma":0.002333942,"domain_scores_codex":[0.9951834,0.00199289,0.0002691809,0.0005426693,0.001594636,0.0004171185],"domain_scores_gemma":[0.9759716,0.0171989,0.0006460077,0.004869815,0.0009589524,0.0003546902],"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.0005053002,0.0001301815,0.001680796,0.0003107907,0.00006233501,0.0001103335,0.0004089841,0.1022922,0.001808166,0.6408342,0.005429785,0.2464269],"study_design_scores_gemma":[0.00007333488,0.0001022087,0.0002157223,0.0001070701,0.00006119206,0.0001784363,0.00009081465,0.3229589,0.002057937,0.6660079,0.008100422,0.00004607308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0819635,0.01021648,0.8560948,0.004053629,0.0003139614,0.00008352415,0.0001616706,0.002112391,0.04500004],"genre_scores_gemma":[0.7428257,0.004849875,0.23969,0.0007314979,0.0004301085,0.0001589546,0.0001464838,0.0008472557,0.01032005],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007773248,"threshold_uncertainty_score":0.04110938,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03073789094384464,"score_gpt":0.2530408548367661,"score_spread":0.2223029638929215,"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."}}