{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002453703,0.001414622,0.001010337,0.001164751,0.001209739,0.002909049,0.004132112,0.001052621,0.009806789],"category_scores_gemma":[0.009838056,0.0007531354,0.001364647,0.002674548,0.001648533,0.008788616,0.002613391,0.002694055,0.002735478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003066509,"about_ca_system_score_gemma":0.005084837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00408217,"about_ca_topic_score_gemma":0.007199058,"domain_scores_codex":[0.9944522,0.0009735788,0.00035674,0.0005123586,0.002628643,0.001076438],"domain_scores_gemma":[0.9871771,0.007028533,0.0008329612,0.003219872,0.001360013,0.0003814236],"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.0025883,0.0008635038,0.002747289,0.000974999,0.0002487802,0.000228371,0.000422663,0.1819793,0.06111629,0.1706298,0.02982188,0.5483787],"study_design_scores_gemma":[0.0002367088,0.0004196209,0.000895995,0.0000778219,0.0001851351,0.0003557566,0.0001035323,0.847406,0.03484403,0.1063605,0.009036685,0.00007813655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09860279,0.002379435,0.8687894,0.001924504,0.000350105,0.0003889909,0.0004958658,0.0061728,0.02089616],"genre_scores_gemma":[0.3987048,0.001306276,0.5825707,0.0006819159,0.0002416284,0.0005550965,0.001140089,0.001356233,0.01344334],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009806789,"threshold_uncertainty_score":0.03280693,"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."}}