On the public citation graph
On the Complexity of Universal Leader Election
0 signed · 96 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/0470072644openalex-snapshot
Design and Analysis of Distributed Algorithms
inferredcites →https://doi.org/10.1006/jcss.1997.1534openalex-snapshot
Size-Estimation Framework with Applications to Transitive Closure and Reachability
inferredcites →https://doi.org/10.1007/978-3-642-33090-2_42openalex-snapshot
Knowledge, Level of Symmetry, and Time of Leader Election
inferredcites →https://doi.org/10.1007/978-3-642-35668-1_24openalex-snapshot
Sublinear Bounds for Randomized Leader Election
inferredcites →https://doi.org/10.1007/s00446-012-0157-9openalex-snapshot
Efficient distributed approximation algorithms via probabilistic tree embeddings
inferredcites →https://doi.org/10.1016/0304-3975(89)90103-5openalex-snapshot
Optimal lower bounds for some distributed algorithms for a complete network of processors
inferredcites →https://doi.org/10.1016/0743-7315(90)90074-yopenalex-snapshot
Time-optimal leader election in general networks
inferredcites →https://doi.org/10.1017/cbo9781139168724openalex-snapshot
Introduction to Distributed Algorithms
inferredcites →https://doi.org/10.1137/0220023openalex-snapshot
Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks
inferredcites →https://doi.org/10.1137/1.9780898719772openalex-snapshot
Distributed Computing: A Locality-Sensitive Approach
inferredcites →https://doi.org/10.1145/28395.28421openalex-snapshot
Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems
inferredcites →https://doi.org/10.1145/601858.601861openalex-snapshot
The cougar approach to in-network query processing in sensor networks
inferredcites →https://doi.org/10.1145/7531.7919openalex-snapshot
Electing a leader in a synchronous ring
inferredcites →https://doi.org/10.1145/77600.77618openalex-snapshot
A trade-off between information and communication in broadcast protocols
inferredcites →https://doi.org/10.1145/77606.77610openalex-snapshot
A modular technique for the design of efficient distributed leader finding algorithms
inferredcites →https://doi.org/10.1145/958491.958508openalex-snapshot
Timing-sync protocol for sensor networks
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-36987-3_7openalex-snapshot
Round-Message Trade-Off in Distributed Steiner Tree Construction in the CONGEST Model
inferred← citeshttps://doi.org/10.1007/978-3-030-64348-5_14openalex-snapshot
Smoothed Analysis of Leader Election in Distributed Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-91014-3_6openalex-snapshot
Weak Amnesiac Flooding of Multiple Messages
inferred← citeshttps://doi.org/10.1007/978-3-031-30448-4_23openalex-snapshot
Improved Deterministic Leader Election in Diameter-Two Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-60603-8_17openalex-snapshot
Towards Singular Optimality in the Presence of Local Initial Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-031-60603-8_3openalex-snapshot
Awake Complexity of Distributed Minimum Spanning Tree
inferred← citeshttps://doi.org/10.1007/978-3-031-81404-4_9openalex-snapshot
Faster Leader Election and Its Applications for Mobile Agents with Parameter Advice
inferred← citeshttps://doi.org/10.1007/978-3-032-11127-2_11openalex-snapshot
Computing Tree Structures in Anonymous Graphs via Mobile Agents
inferred← citeshttps://doi.org/10.1007/978-3-319-48314-6_6openalex-snapshot
Message Lower Bounds via Efficient Network Synchronization
inferred← citeshttps://doi.org/10.1007/978-3-662-53426-7_2openalex-snapshot
Deterministic Leader Election in $$O(D+\log n)$$ Time with Messages of Size O(1)
inferred← citeshttps://doi.org/10.1007/s00446-019-00354-2openalex-snapshot
The complexity of leader election in diameter-two networks
inferred← citeshttps://doi.org/10.1007/s00446-020-00387-yopenalex-snapshot
Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model
inferred← citeshttps://doi.org/10.1007/s00446-023-00448-yopenalex-snapshot
Termination of amnesiac flooding
inferred← citeshttps://doi.org/10.1007/s00446-025-00483-xopenalex-snapshot
Tight bounds on the message complexity of distributed tree verification
inferred← citeshttps://doi.org/10.1007/s00446-025-00487-7openalex-snapshot
Near-Optimal Leader Election in Population Protocols on Graphs
inferred← citeshttps://doi.org/10.1007/s00453-018-0517-3openalex-snapshot
Deterministic Leader Election Takes $$\Theta (D + \log n)$$ Θ ( D + log n ) Bit Rounds
inferred← citeshttps://doi.org/10.1007/s00453-022-01068-xopenalex-snapshot
Leader Election in Well-Connected Graphs
inferred← citeshttps://doi.org/10.1007/s00453-023-01095-2openalex-snapshot
Transmitting Once to Elect a Leader on Wireless Networks
inferred← citeshttps://doi.org/10.1007/s10791-026-10563-6openalex-snapshot
Policy separated learning assisted COPRAS based leader election for dynamic clustered distributed systems
inferred← citeshttps://doi.org/10.1007/s41468-023-00150-9openalex-snapshot
The topology of randomized symmetry-breaking distributed computing
inferred← citeshttps://doi.org/10.1016/j.automatica.2022.110583openalex-snapshot
Near-optimal knowledge-free resilient leader election
inferred← citeshttps://doi.org/10.1016/j.ejcon.2023.100848openalex-snapshot
Distributed computation of exact average degree and network size in finite time under quantized communication
inferred← citeshttps://doi.org/10.1016/j.ifacol.2020.12.1497openalex-snapshot
A Resilient Leader Election Algorithm Using Aggregate Computing Blocks
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.11.006openalex-snapshot
Latency, capacity, and distributed minimum spanning trees
inferred← citeshttps://doi.org/10.1016/j.jpdc.2021.08.004openalex-snapshot
Improved distributed approximation for Steiner tree in the CONGEST model
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.11.017openalex-snapshot
Message lower bounds via efficient network synchronization
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114161openalex-snapshot
Communication costs in a geometric communication network
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115578openalex-snapshot
Faster leader election via mobile agents and its applications
inferred← citeshttps://doi.org/10.1080/17445760.2021.1879067openalex-snapshot
A synod based deterministic and indulgent leader election protocol for asynchronous large groups
inferred← citeshttps://doi.org/10.1109/icdcs.2019.00044openalex-snapshot
The Communication Cost of Information Spreading in Dynamic Networks
inferred← citeshttps://doi.org/10.1109/icdcs47774.2020.00055openalex-snapshot
Latency, Capacity, and Distributed Minimum Spanning Tree
inferred← citeshttps://doi.org/10.1109/icdcs51616.2021.00050openalex-snapshot
Time and Communication Complexity of Leader Election in Anonymous Networks
inferred← citeshttps://doi.org/10.1109/icdcs54860.2022.00011openalex-snapshot
Byzantine-Resilient Counting in Networks
inferred← citeshttps://doi.org/10.1109/ipdps.2019.00094openalex-snapshot
Network Size Estimation in Small-World Networks Under Byzantine Faults
inferred← citeshttps://doi.org/10.1109/ispdc52870.2021.9521629openalex-snapshot
Weak Amnesiac Flooding
inferred← citeshttps://doi.org/10.1109/mass.2017.60openalex-snapshot
Maintaining Connectivity in Ad Hoc Networks Through WiFi Direct
inferred← citeshttps://doi.org/10.1109/tpds.2023.3239993openalex-snapshot
On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement
inferred← citeshttps://doi.org/10.1137/1.9781611976465.126openalex-snapshot
Being Fast Means Being Chatty: The Local Information Cost of Graph Spanners
inferred← citeshttps://doi.org/10.1142/s1793830921500087openalex-snapshot
Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree
inferred← citeshttps://doi.org/10.1145/2767386.2767405openalex-snapshot
Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication
inferred← citeshttps://doi.org/10.1145/2902945.2902959openalex-snapshot
Distributed Algorithmic Foundations of Dynamic Networks
inferred← citeshttps://doi.org/10.1145/3007748.3007775openalex-snapshot
Time-communication trade-offs for minimum spanning tree construction
inferred← citeshttps://doi.org/10.1145/3007748.3007784openalex-snapshot
Distributed Computation of Mixing Time
inferred← citeshttps://doi.org/10.1145/3055399.3055449openalex-snapshot
A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees
inferred← citeshttps://doi.org/10.1145/3154273.3154308openalex-snapshot
The Complexity of Leader Election
inferred← citeshttps://doi.org/10.1145/3212734.3212737openalex-snapshot
Round- and Message-Optimal Distributed Graph Algorithms
inferred← citeshttps://doi.org/10.1145/3212734.3212751openalex-snapshot
Sublinear Message Bounds for Randomized Agreement
inferred← citeshttps://doi.org/10.1145/3212734.3212754openalex-snapshot
Leader Election in Well-Connected Graphs
inferred← citeshttps://doi.org/10.1145/3365005openalex-snapshot
A time- and message-optimal distributed algorithm for minimum spanning trees
inferred← citeshttps://doi.org/10.1145/3369740.3369786openalex-snapshot
Fully Compact Routing in Low Memory Self-Healing Trees
inferred← citeshttps://doi.org/10.1145/3465084.3467484openalex-snapshot
Byzantine Agreement and Leader Election
inferred← citeshttps://doi.org/10.1145/3465084.3467909openalex-snapshot
Can We Break Symmetry with o(m) Communication?
inferred← citeshttps://doi.org/10.1145/3491003.3491005openalex-snapshot
Message Complexity of Multi-Valued Implicit Agreement with Shared Random Bits
inferred← citeshttps://doi.org/10.1145/3519270.3538435openalex-snapshot
Near-Optimal Leader Election in Population Protocols on Graphs
inferred← citeshttps://doi.org/10.1145/3519270.3538459openalex-snapshot
Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds
inferred← citeshttps://doi.org/10.1145/3583668.3594576openalex-snapshot
Improved Tradeoffs for Leader Election
inferred← citeshttps://doi.org/10.1145/3732772.3733504openalex-snapshot
Brief Announcement: Rise and Shine Efficiently! The Complexity of Adversarial Wake-up
inferred← citeshttps://doi.org/10.1145/3732772.3733506openalex-snapshot
Message Optimality and Message-Time Trade-offs for APSP and Beyond
inferred← citeshttps://doi.org/10.1145/3732772.3733509openalex-snapshot
Quantum Communication Advantage for Leader Election and Agreement
inferred← citeshttps://doi.org/10.1145/3816782.3819194openalex-snapshot
Time-, Message- and Memory-Efficient Distributed Minimum Spanning Tree and Partwise Aggregation
inferred← citeshttps://doi.org/10.1145/3816782.3819199openalex-snapshot
Near-Optimal Bounds for Adversarial Wake-up in Distributed Networks
inferred← citeshttps://doi.org/10.18280/isi.280405openalex-snapshot
A Robust, Preference-Based Coordinator Election Algorithm for Distributed Systems
inferred← citeshttps://doi.org/10.19105/ojbs.v17i1.8619openalex-snapshot
Anxiety Caused by Too Many Cats in Bohumil Hrabal’s “All My Cats”
inferred← citeshttps://doi.org/10.34028/iajit/17/6/5openalex-snapshot
Specification of Synchronous Network Flooding in Temporal Logic
inferred← citeshttps://doi.org/10.4230/lipics.disc.2019.7openalex-snapshot
Message Reduction in the LOCAL Model Is a Free Lunch
inferred← citeshttps://doi.org/10.4230/lipics.disc.2020.22openalex-snapshot
Singularly Optimal Randomized Leader Election
inferred← citeshttps://doi.org/10.4230/lipics.disc.2020.31openalex-snapshot
Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine Protocols
inferred← citeshttps://doi.org/10.4230/lipics.disc.2021.27openalex-snapshot
Singularly Near Optimal Leader Election in Asynchronous Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1610.05646openalex-snapshot
Distributed Computation of Mixing Time
inferred← citeshttps://doi.org/10.48550/arxiv.1803.03042openalex-snapshot
Self-healing Routing and Other Problems in Compact Memory.
inferred← citeshttps://doi.org/10.48550/arxiv.1902.08979openalex-snapshot
Latency, Capacity, and Distributed MST
inferred← citeshttps://doi.org/10.48550/arxiv.1907.12011openalex-snapshot
Distributed Approximation Algorithms for Steiner Tree in the $\mathcal{CONGESTED}$ $\mathcal{CLIQUE}$
inferred← citeshttps://doi.org/10.48550/arxiv.2006.07449openalex-snapshot
Sleeping is Efficient: MIS in $O(1)$-rounds Node-averaged Awake Complexity
inferred← citeshttps://doi.org/10.48550/arxiv.2009.05776openalex-snapshot
Terminating cases of flooding
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.