{"id":"W6910341342","doi":"10.4230/lipics.opodis.2023.17","title":"A Wait-Free Deque With Polylogarithmic Step Complexity","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Amortized analysis; Stack (abstract data type); Queue; Computational complexity theory; Data structure; Time complexity","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.002014438,0.001001385,0.0009382425,0.0009436246,0.001778183,0.005611476,0.003766101,0.001472848,0.008093324],"category_scores_gemma":[0.007302118,0.0007831536,0.001214305,0.001305473,0.002048458,0.008459822,0.003556189,0.003107172,0.002135252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001913543,"about_ca_system_score_gemma":0.004320692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002307366,"about_ca_topic_score_gemma":0.002560391,"domain_scores_codex":[0.9963081,0.0003896175,0.0003581279,0.0006350499,0.001658038,0.0006511869],"domain_scores_gemma":[0.9930582,0.002036846,0.0004119186,0.002539089,0.001564832,0.0003890249],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001887447,0.0006324621,0.002721762,0.0006278321,0.0002021451,0.0003814584,0.0004681751,0.04855362,0.06985081,0.6656688,0.009712988,0.1992925],"study_design_scores_gemma":[0.0004320843,0.0008334168,0.001166565,0.0001100404,0.0002932733,0.000672735,0.0002138398,0.3842598,0.1061484,0.461469,0.04414091,0.0002599874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06550699,0.0005049565,0.9184383,0.0006017382,0.0002463147,0.0001786564,0.0002712508,0.004021818,0.01023017],"genre_scores_gemma":[0.4488452,0.0004144198,0.5306497,0.0003770634,0.0001546322,0.0004254038,0.0005330266,0.0008002615,0.01780032],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008093324,"threshold_uncertainty_score":0.02707487,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01784283380366237,"score_gpt":0.2483034230075164,"score_spread":0.2304605892038541,"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."}}