{"id":"W2612636087","doi":"10.4230/lipics.opodis.2016.34","title":"Deletion without Rebalancing in Non-Blocking Binary Search Trees","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Dalhousie University","keywords":"Blocking (statistics); Computer science; Binary search tree; Tree (set theory); Binary tree; Lock (firearm); Bounded function; Optimal binary search tree; Algorithm; Theoretical computer science; K-ary tree; Combinatorics; Mathematics; Tree structure","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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009297354,0.0002677721,0.0003346725,0.000275337,0.000940721,0.001248227,0.002307358,0.0001430091,0.000004917678],"category_scores_gemma":[0.00009307522,0.0002526035,0.0001147602,0.0002152426,0.0001117379,0.002897487,0.0009251341,0.0003871365,0.00009334862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001235867,"about_ca_system_score_gemma":0.00008402547,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001690698,"about_ca_topic_score_gemma":0.00010101,"domain_scores_codex":[0.9977942,0.00002127168,0.0007524267,0.000343659,0.0004113775,0.0006771351],"domain_scores_gemma":[0.9975494,0.00007716737,0.0003951689,0.001659568,0.000165325,0.0001534407],"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.0001266255,0.00115085,0.245998,0.0009893136,0.0002090871,0.00004774126,0.03856615,0.002418578,0.001502031,0.03077377,0.007698961,0.6705189],"study_design_scores_gemma":[0.001828564,0.000131305,0.04228935,0.0003252929,0.000009798334,0.00003300126,0.0005837318,0.9441335,0.0007090726,0.0003929455,0.009134793,0.0004287027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4911875,0.00001937829,0.5020413,0.001063506,0.000531173,0.0009416654,0.0001831817,0.0001780336,0.003854359],"genre_scores_gemma":[0.907766,0.00002505735,0.09134594,0.0002312689,0.0001237788,0.0001343301,0.0001663278,0.00002408809,0.0001832239],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9417149,"threshold_uncertainty_score":0.9999926,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02315242208962659,"score_gpt":0.3028318129520669,"score_spread":0.2796793908624403,"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."}}