On the public citation graph
The Bit Complexity of Randomized Leader Election on a Ring
0 signed · 23 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.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.1145/1634.1889openalex-snapshot
Lower Bounds for Distributed Maximum-Finding Algorithms
inferredcites →https://doi.org/10.1145/69622.357194openalex-snapshot
An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1996.0828openalex-snapshot
Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings
inferred← citeshttps://doi.org/10.1007/3-540-45414-4_16openalex-snapshot
A Space Optimal, Deterministic, Self-stabilizing, Leader Election Algorithm for Unidirectional Rings
inferred← citeshttps://doi.org/10.1007/978-3-319-09581-3_2openalex-snapshot
Leader Election in Rings with Homonyms
inferred← citeshttps://doi.org/10.1007/978-3-540-30555-2_4openalex-snapshot
Fair Leader Election by Randomized Voting
inferred← citeshttps://doi.org/10.1007/bf01784021openalex-snapshot
Randomized function evaluation on a ring
inferred← citeshttps://doi.org/10.1007/bfb0019812openalex-snapshot
Randomized function evaluation on a ring
inferred← citeshttps://doi.org/10.1007/bfb0028286openalex-snapshot
Probabilistic leader election on rings of known size
inferred← citeshttps://doi.org/10.1007/s00446-003-0091-yopenalex-snapshot
Hundreds of impossibility results for distributed computing
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/0304-3975(91)90193-6openalex-snapshot
New lower bound techniques for distributed leader finding and other problems on rings of processors
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00178-lopenalex-snapshot
Anonymous wireless rings
inferred← citeshttps://doi.org/10.1109/icnc.2014.6975876openalex-snapshot
Led by nature: Distributed leader election in anonymous 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.1137/s0097539798285997openalex-snapshot
Self-Stabilizing Symmetry Breaking in Constant Space
inferred← citeshttps://doi.org/10.1142/s0129065715500252openalex-snapshot
Simple Algorithms for Distributed Leader Election in Anonymous Synchronous Rings and Complete Networks Inspired by Neural Development in Fruit Flies
inferred← citeshttps://doi.org/10.1145/10590.10604openalex-snapshot
Probabilistic solitude verification on a ring
inferred← citeshttps://doi.org/10.1145/174652.174656openalex-snapshot
Tight lower bounds for probabilistic solitude verification on anonymous rings
inferred← citeshttps://doi.org/10.1145/174666.174667openalex-snapshot
On randomization in sequential and distributed algorithms
inferred← citeshttps://doi.org/10.1145/3465084.3467936openalex-snapshot
The Topology of Randomized Symmetry-Breaking Distributed Computing
inferred← citeshttps://doi.org/10.11575/prism/30833openalex-snapshot
SELF-STABILIZING TOKEN CIRCULATION ON ANONYMOUS MESSAGE PASSING RINGS
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.