{"id":"W162658627","doi":"10.1007/978-3-642-41527-2_4","title":"An $O(\\sqrt n)$ Space Bound for Obstruction-Free Leader Election","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Leader election; Upper and lower bounds; Combinatorics; Binary logarithm; Randomized algorithm; Mathematics; Asynchronous communication; Discrete mathematics; Time complexity; Algorithm; Computer science; Theoretical computer science; Computer network","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.002373322,0.001953773,0.002233294,0.001505485,0.003017584,0.003954863,0.00450543,0.002178173,0.04318206],"category_scores_gemma":[0.01230296,0.0008691732,0.001764923,0.00263635,0.002788861,0.009845881,0.007746038,0.00724281,0.01027828],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002970617,"about_ca_system_score_gemma":0.003636709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003193681,"about_ca_topic_score_gemma":0.007229388,"domain_scores_codex":[0.9958153,0.0008810188,0.0001667963,0.0006911975,0.001433402,0.001012185],"domain_scores_gemma":[0.9918851,0.004425872,0.0002807427,0.002499795,0.0004678325,0.000440645],"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.001628201,0.0004746655,0.0006233314,0.0006959855,0.0001484325,0.0001540144,0.0005133013,0.08182092,0.01083087,0.5152131,0.1004683,0.2874289],"study_design_scores_gemma":[0.0003429272,0.0002462843,0.0004603654,0.000115996,0.0001331699,0.0001798892,0.0001423778,0.3897055,0.003737291,0.5767053,0.02814813,0.00008272084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01920279,0.002570797,0.8648146,0.005022467,0.001615063,0.0002867946,0.000613877,0.005686155,0.1001873],"genre_scores_gemma":[0.5353004,0.001876927,0.3797123,0.002299458,0.001458502,0.001279461,0.001464449,0.002403555,0.07420502],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04318206,"threshold_uncertainty_score":0.1444584,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01574022883031462,"score_gpt":0.2469428003752739,"score_spread":0.2312025715449593,"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."}}