On the public citation graph

Electing a leader in a ring with link failures

0 signed · 31 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/0196-6774(82)90023-2openalex-snapshot
An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
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.1016/0890-5401(88)90016-8openalex-snapshot
The multi-tree approach to reliability in distributed networks
inferredcites →https://doi.org/10.1109/proc.1977.10647openalex-snapshot
Information processing
inferredcites →https://doi.org/10.1109/sfcs.1981.41openalex-snapshot
Symmetry breaking in distributive networks
inferredcites →https://doi.org/10.1145/357195.357200openalex-snapshot
A Distributed Algorithm for Minimum-Weight Spanning Trees
inferredcites →https://doi.org/10.1145/358506.358517openalex-snapshot
On an improved algorithm for decentralized extrema finding in circular configurations of processors
inferredcites →https://doi.org/10.1145/359024.359029openalex-snapshot
Decentralized extrema-finding in circular configurations of processors
inferredcites →https://doi.org/10.1145/359104.359108openalex-snapshot
An improved algorithm for decentralized extrema-finding in circular configurations of processes
inferredcites →https://doi.org/10.1145/69622.357194openalex-snapshot
An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
inferredcites →https://doi.org/10.1145/800057.808719openalex-snapshot
The impact of synchronous communication on the problem of electing a leader in a ring
inferredcites →https://doi.org/10.1145/800057.808725openalex-snapshot
Distributed elections in an archimedean ring of processors
inferredcites →https://doi.org/10.1145/800222.806741openalex-snapshot
Elections in the presence of faults

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.1007/3-540-45414-4_12openalex-snapshot
Mobile Search for a Black Hole in an Anonymous Ring
inferred← citeshttps://doi.org/10.1007/3-540-53487-3_54openalex-snapshot
Distributed reset
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-540-92221-6_32openalex-snapshot
Leader Election in Extremely Unreliable Rings and Complete Networks
inferred← citeshttps://doi.org/10.1007/bf02252955openalex-snapshot
On the complexity of computation in the presence of link failures: the case of a ring
inferred← citeshttps://doi.org/10.1007/s00446-015-0242-yopenalex-snapshot
Fast and compact self-stabilizing verification, computation, and fault detection of an MST
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.1016/0196-6774(88)90017-xopenalex-snapshot
Fault tolerant distributed majority commitment
inferred← citeshttps://doi.org/10.1109/12.286303openalex-snapshot
Information dissemination in distributed systems with faulty units
inferred← citeshttps://doi.org/10.1109/12.660164openalex-snapshot
Optimal elections in faulty loop networks and applications
inferred← citeshttps://doi.org/10.1109/32.54293openalex-snapshot
Optimal distributed t-resilient election in complete networks
inferred← citeshttps://doi.org/10.1109/iscas.1988.14987openalex-snapshot
Distributed algorithms in faulty networks
inferred← citeshttps://doi.org/10.1109/spdp.1990.143593openalex-snapshot
Randomized fault-detecting leader election in a bi-directional ring
inferred← citeshttps://doi.org/10.1109/spdp.1994.346162openalex-snapshot
Election on faulty rings with incomplete size information
inferred← citeshttps://doi.org/10.1145/1835698.1835742openalex-snapshot
Efficient threshold detection in a distributed environment
inferred← citeshttps://doi.org/10.1145/1993806.1993866openalex-snapshot
Fast and compact self stabilizing verification, computation, and fault detection of an MST
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.