On the public citation graph
Efficient leader election using sense of direction
0 signed · 35 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.1007/3-540-51687-5_41openalex-snapshot
Optimal fault-tolerant distributed algorithms for election in complete networks with a global sense of direction
inferredcites →https://doi.org/10.1007/bf01553900openalex-snapshot
Efficient elections in chordal ring networks
inferredcites →https://doi.org/10.1016/0020-0190(86)90025-6openalex-snapshot
Election in a complete network with a sense of direction
inferredcites →https://doi.org/10.1016/0020-0190(91)90069-topenalex-snapshot
Towards optimal distributed election on chordal rings
inferredcites →https://doi.org/10.1016/0020-0255(94)90071-xopenalex-snapshot
A near-optimal multistage distributed algorithm for finding leaders in clustered chordal rings
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.1137/0220023openalex-snapshot
Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks
inferredcites →https://doi.org/10.1145/1008959.1008961openalex-snapshot
Sense of direction, topological awareness and communication complexity
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(199810)32:3<165::aid-net1>3.0.co;2-iopenalex-snapshot
Sense of direction: Definitions, properties, and classes
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_27openalex-snapshot
Time and Message Optimal Leader Election in Asynchronous Oriented Complete Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-24922-9_2openalex-snapshot
On Sense of Direction and Mobile Agents
inferred← citeshttps://doi.org/10.1007/bfb0056468openalex-snapshot
Sense of direction in distributed computing
inferred← citeshttps://doi.org/10.1007/s00446-009-0088-2openalex-snapshot
Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.02.009openalex-snapshot
Sublinear bounds for randomized leader election
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00051-1openalex-snapshot
Symmetries and sense of direction in labeled graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00395-4openalex-snapshot
Sense of direction in distributed computing
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00592-3openalex-snapshot
Computing on anonymous networks with sense of direction
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/aina.2010.98openalex-snapshot
The Power of Orientation in Symmetry-Breaking
inferred← citeshttps://doi.org/10.1109/ccwc51732.2021.9375920openalex-snapshot
On distributed forest decomposition of graphs with bounded arboricity
inferred← citeshttps://doi.org/10.1109/empdp.2005.21openalex-snapshot
Efficient Leader Election in Complete Networks
inferred← citeshttps://doi.org/10.1109/ipdps.2006.1639281openalex-snapshot
Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds
inferred← citeshttps://doi.org/10.1109/pdp.2007.18openalex-snapshot
AModified O(n) Leader Election Algorithm for Complete Networks
inferred← citeshttps://doi.org/10.1137/s0097539700377293openalex-snapshot
Backward Consistency and Sense of Direction in Advanced Distributed Systems
inferred← citeshttps://doi.org/10.1142/9789812791146_0031openalex-snapshot
ZONEPOW: A NOVEL APPROACH TO POWER CONTROL IN AD-HOC NETWORKS
inferred← citeshttps://doi.org/10.1142/s0129054198000131openalex-snapshot
TOPOLOGICAL CONSTRAINTS FOR SENSE OF DIRECTION
inferred← citeshttps://doi.org/10.1145/1400751.1400757openalex-snapshot
Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition
inferred← citeshttps://doi.org/10.1145/301308.301357openalex-snapshot
Backward consistency and sense of direction in advanced distributed systems
inferred← citeshttps://doi.org/10.21917/ijct.2016.0197openalex-snapshot
A DISTRIBUTED RING ALGORITHM FOR COORDINATOR ELECTION IN DISTRIBUTED SYSTEMS
inferred← citeshttps://doi.org/10.4230/lipics.disc.2020.22openalex-snapshot
Singularly Optimal Randomized Leader Election
inferred← citeshttps://doi.org/10.4230/lipics.disc.2021.27openalex-snapshot
Singularly Near Optimal Leader Election in Asynchronous Networks
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.5555/1898953.1898978openalex-snapshot
Distributed coloring in Õ (√log n) Bit Rounds
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.