{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002063233,0.00005391936,0.00006163236,0.00004946204,0.0001305429,0.00006057717,0.0002602012,0.00001599839,0.000009549603],"category_scores_gemma":[0.00006537744,0.0000254047,0.00001329376,0.0002020084,0.0001652708,0.0002163768,0.0000986576,0.00004319933,0.00001210164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007940688,"about_ca_system_score_gemma":0.0000644961,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000667372,"about_ca_topic_score_gemma":0.00001092161,"domain_scores_codex":[0.9993597,0.00003873296,0.0001033161,0.0001405327,0.0001991834,0.000158498],"domain_scores_gemma":[0.9987124,0.0008291386,0.00003044874,0.0002448892,0.0001268877,0.0000562271],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001896835,0.0001005408,0.0002954244,0.000009058755,0.00005851044,0.000008734921,0.002944121,0.0002000082,0.001327641,0.07963323,0.002728826,0.912675],"study_design_scores_gemma":[0.00815605,0.007197273,0.07749283,0.0006005812,0.00005440033,0.0001218843,0.002497069,0.6965871,0.01301444,0.03305311,0.159563,0.001662306],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02051677,0.0003275621,0.9245377,0.0451043,0.000121269,0.0004939454,0.00001281191,0.0001263015,0.008759357],"genre_scores_gemma":[0.8985838,0.0004286635,0.0974253,0.0001683224,0.00001172322,0.00002035608,9.104741e-7,0.00001003406,0.003350896],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9110126,"threshold_uncertainty_score":0.1035974,"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."}}