{"id":"W2044936698","doi":"10.1016/j.comgeo.2012.09.007","title":"An in-place min–max priority search tree","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Optimal binary search tree; Heap (data structure); Range tree; Binary search tree; Interval tree; Self-balancing binary search tree; K-ary tree; Binary tree; Tree (set theory); Combinatorics; Search tree; Segment tree; Mathematics; Tree traversal; Data structure; Ternary search tree; Set (abstract data type); Point (geometry); Computer science; Depth-first search; Algorithm; Search algorithm; Tree structure","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.00129793,0.0007791088,0.001301133,0.001500579,0.001202474,0.00180665,0.003191432,0.001540739,0.02068657],"category_scores_gemma":[0.005333984,0.0008232645,0.0007951974,0.001777426,0.0004829105,0.002300474,0.002199426,0.00173643,0.004608279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007765201,"about_ca_system_score_gemma":0.002598317,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002078811,"about_ca_topic_score_gemma":0.004907447,"domain_scores_codex":[0.9990425,0.0002069292,0.00008490591,0.0001678092,0.0003297514,0.000168103],"domain_scores_gemma":[0.998195,0.0006645697,0.0001027357,0.0003360372,0.0005174896,0.0001841903],"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.001622416,0.0007668245,0.00211519,0.0008146003,0.0001097214,0.0002941703,0.0003147726,0.1179403,0.01211004,0.05984997,0.04290215,0.7611598],"study_design_scores_gemma":[0.0003448322,0.0005959029,0.0005804756,0.00009389986,0.0001203679,0.0004137595,0.0001768021,0.8711601,0.01240524,0.08217034,0.03187948,0.0000587696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01591218,0.0005106406,0.9631991,0.000529575,0.0002948949,0.0002722779,0.0007220686,0.003217824,0.01534137],"genre_scores_gemma":[0.1216519,0.0002282428,0.8649433,0.0002747185,0.00009980683,0.000159482,0.001253358,0.0005496889,0.01083943],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02068657,"threshold_uncertainty_score":0.06920344,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02506329569885934,"score_gpt":0.302463652275976,"score_spread":0.2774003565771166,"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."}}