{"id":"W2072721374","doi":"10.1145/2611462.2611486","title":"The amortized complexity of non-blocking binary search trees","year":2014,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University; University of Toronto","funders":"European Social Fund","keywords":"Optimal binary search tree; Blocking (statistics); Binary tree; Computer science; Amortized analysis; Self-balancing binary search tree; Swap (finance); Binary search tree; Search tree; Tree (set theory); Binary number; Combinatorics; Mathematics; Algorithm; Theoretical computer science; Data structure; Tree structure; Interval tree; Search algorithm; Arithmetic; Operating system","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005200385,0.00006876009,0.0001140211,0.00003238342,0.0002600606,0.00008962117,0.001051883,0.0000221018,0.00001577527],"category_scores_gemma":[0.00002244336,0.00003819364,0.00004211618,0.0001774995,0.0001432753,0.0001916475,0.000736912,0.00008047922,0.00001770876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006682414,"about_ca_system_score_gemma":0.00002395426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002333866,"about_ca_topic_score_gemma":0.00002963498,"domain_scores_codex":[0.9991029,0.0000791921,0.0001704483,0.0001864804,0.0002750291,0.0001859323],"domain_scores_gemma":[0.9989282,0.0002150164,0.00005224629,0.0006878958,0.00006578441,0.00005087175],"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.0000411136,0.0002036641,0.004010151,0.00002880572,0.00003447521,0.000005348747,0.0007229833,0.0005328651,0.02237355,0.3472596,0.01111448,0.613673],"study_design_scores_gemma":[0.0002448244,0.00007705751,0.0357281,0.00001506718,0.000001287829,0.000002045246,0.00002504857,0.9518209,0.004797124,0.003583495,0.003632281,0.00007280677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06950264,0.00003658782,0.9235629,0.0008869077,0.0001748834,0.00009002746,0.000001407807,0.00006935625,0.00567531],"genre_scores_gemma":[0.9318219,0.000009776703,0.06778543,0.00006878753,0.00004414142,0.000002570725,0.000001835708,0.000003260061,0.0002622425],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.951288,"threshold_uncertainty_score":0.2000202,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04037716498594415,"score_gpt":0.289374557897391,"score_spread":0.2489973929114468,"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."}}