{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001869347,0.0007816267,0.001059751,0.0007655892,0.001119307,0.001726772,0.002848278,0.001095943,0.004062423],"category_scores_gemma":[0.006140542,0.0007784342,0.0009515673,0.001236705,0.001223076,0.003576007,0.002445995,0.00180727,0.00152075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001242608,"about_ca_system_score_gemma":0.002573906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003508571,"about_ca_topic_score_gemma":0.004516314,"domain_scores_codex":[0.9975721,0.0005772191,0.0001518805,0.0003653347,0.000761319,0.0005721179],"domain_scores_gemma":[0.9964682,0.001388223,0.0004892183,0.000859903,0.0005583192,0.0002362299],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001670081,0.0005993347,0.003275023,0.001130468,0.0001121016,0.0004641894,0.001163681,0.449583,0.07172158,0.0932657,0.009679994,0.3673348],"study_design_scores_gemma":[0.0003811075,0.0003982296,0.0005936341,0.00008044463,0.00007781918,0.0003854187,0.0002860866,0.9143007,0.02339964,0.04843636,0.0115903,0.00007028835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08440622,0.0006685607,0.9018636,0.0005027236,0.00008405554,0.0003115495,0.0003154642,0.005328973,0.006518881],"genre_scores_gemma":[0.4449048,0.0003658609,0.5446966,0.0005239371,0.00007198796,0.0004238257,0.0008652643,0.0009569644,0.0071908],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004062423,"threshold_uncertainty_score":0.01359016,"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."}}