On the public citation graph

Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks

0 signed · 55 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0304-3975(81)90109-2openalex-snapshot
On describing the behavior and implementation of distributed systems
inferredcites →https://doi.org/10.1145/2402.322387openalex-snapshot
Efficiency of Synchronous Versus Asynchronous Distributed Systems
inferredcites →https://doi.org/10.1145/357195.357200openalex-snapshot
A Distributed Algorithm for Minimum-Weight Spanning Trees
inferredcites →https://doi.org/10.1145/7531.7919openalex-snapshot
Electing a leader in a synchronous ring

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/0470072644openalex-snapshot
Design and Analysis of Distributed Algorithms
inferred← citeshttps://doi.org/10.1002/0471224561.ch10openalex-snapshot
Leader Election Protocols for Radio Networks
inferred← citeshttps://doi.org/10.1002/9781118256107.ch18openalex-snapshot
Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/11947950_34openalex-snapshot
Improved Distributed Exploration of Anonymous Networks
inferred← citeshttps://doi.org/10.1007/978-1-4471-2120-6_15openalex-snapshot
Algebraic Specification of Dynamic Leader Election Protocols in Broadcast Networks
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-031-30448-4_23openalex-snapshot
Improved Deterministic Leader Election in Diameter-Two Networks
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-642-35476-2_8openalex-snapshot
Electing a Leader in Multi-hop Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-35668-1_24openalex-snapshot
Sublinear Bounds for Randomized Leader Election
inferred← citeshttps://doi.org/10.1007/bfb0022433openalex-snapshot
Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/s00446-003-0091-yopenalex-snapshot
Hundreds of impossibility results for distributed computing
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/s004460050016openalex-snapshot
Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links
inferred← citeshttps://doi.org/10.1007/s004460050017openalex-snapshot
Design and analysis of dynamic leader election protocols in broadcast networks
inferred← citeshttps://doi.org/10.1007/s004460050033openalex-snapshot
Efficient leader election using sense of direction
inferred← citeshttps://doi.org/10.1016/b978-1-55860-348-6.50026-2openalex-snapshot
10.1016/b978-1-55860-348-6.50026-2
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.02.009openalex-snapshot
Sublinear bounds for randomized leader election
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/s0020-0190(01)00309-xopenalex-snapshot
On a game in directed graphs
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.1093/ietfec/e89-a.5.1355openalex-snapshot
An Energy Efficient Leader Election Protocol for Radio Network with a Single Transceiver
inferred← citeshttps://doi.org/10.1109/71.491576openalex-snapshot
Leader election in the presence of link failures
inferred← citeshttps://doi.org/10.1109/aiccsa.2007.370901openalex-snapshot
New Election Algorithm based on Assistant in Distributed Systems
inferred← citeshttps://doi.org/10.1109/candar.2016.0102openalex-snapshot
On the Complexity of Distributed Wake-Up
inferred← citeshttps://doi.org/10.1109/empdp.2005.21openalex-snapshot
Efficient Leader Election in Complete Networks
inferred← citeshttps://doi.org/10.1109/tase.2007.21openalex-snapshot
Dynamics of Control
inferred← citeshttps://doi.org/10.1109/tencon.1998.797083openalex-snapshot
Optimal distributed leader election algorithm for synchronous complete network
inferred← citeshttps://doi.org/10.1109/tpds.2002.1003864openalex-snapshot
Uniform leader election protocols for radio networks
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.1109/twc.2014.2358644openalex-snapshot
Topology-Transparent Scheduling in Mobile Ad Hoc Networks With Multiple Packet Reception Capability
inferred← citeshttps://doi.org/10.1137/s009753979223277xopenalex-snapshot
Distributed Algorithms For Unidirectional Networks
inferred← citeshttps://doi.org/10.1137/s0097539794276865openalex-snapshot
Leader Election in Complete Networks
inferred← citeshttps://doi.org/10.1145/2484239.2484274openalex-snapshot
On the complexity of universal leader election
inferred← citeshttps://doi.org/10.1145/2699440openalex-snapshot
On the Complexity of Universal Leader Election
inferred← citeshttps://doi.org/10.1145/3154273.3154308openalex-snapshot
The Complexity of Leader Election
inferred← citeshttps://doi.org/10.1145/3212734.3212751openalex-snapshot
Sublinear Message Bounds for Randomized Agreement
inferred← citeshttps://doi.org/10.1145/3465084.3467949openalex-snapshot
Brief Announcement
inferred← citeshttps://doi.org/10.1145/3583668.3594576openalex-snapshot
Improved Tradeoffs for Leader Election
inferred← citeshttps://doi.org/10.1145/3816782.3819199openalex-snapshot
Near-Optimal Bounds for Adversarial Wake-up in Distributed Networks
inferred← citeshttps://doi.org/10.1145/72981.72982openalex-snapshot
A hundred impossibility proofs for distributed computing
inferred← citeshttps://doi.org/10.15803/ijnc.7.2_336openalex-snapshot
On the Cost of Waking Up
inferred← citeshttps://doi.org/10.2478/ausm-2014-0005openalex-snapshot
Leader election in synchronous networks
inferred← citeshttps://doi.org/10.4204/eptcs.132.4openalex-snapshot
Robust Leader Election in a Fast-Changing World
inferred← citeshttps://doi.org/10.4230/lipics.disc.2020.11openalex-snapshot
Communication Efficient Self-Stabilizing Leader Election
inferred← citeshttps://doi.org/10.47749/t/unicamp.1998.128514openalex-snapshot
Algoritmos para eleição de lider em sistemas distribuidos
inferred← citeshttps://doi.org/10.48550/arxiv.1210.4822openalex-snapshot
Sublinear Bounds for Randomized Leader Election
inferred← citeshttps://doi.org/10.48550/arxiv.2001.04235openalex-snapshot
Notes on Theory of Distributed Systems
inferred← citeshttps://doi.org/10.5815/ijieeb.2013.03.04openalex-snapshot
Power Aware Reliable Virtual Machine Coordinator Election Algorithm in Service Oriented Systems
inferred← citeshttps://doi.org/10.5815/ijitcs.2013.01.02openalex-snapshot
Fault Tolerant Message Efficient Coordinator Election Algorithm in High Traffic Bidirectional Ring Network
inferred← citeshttps://doi.org/10.5860/choice.33-0987openalex-snapshot
Introduction to distributed algorithms
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.