On the public citation graph
Efficient elections in chordal ring networks
0 signed · 49 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/0020-0190(86)90025-6openalex-snapshot
Election in a complete network with a sense of direction
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.1109/tc.1981.1675777openalex-snapshot
Analysis of Chordal Ring Network
inferredcites →https://doi.org/10.1145/1008959.1008961openalex-snapshot
Sense of direction, topological awareness and communication complexity
inferredcites →https://doi.org/10.1145/1634.1889openalex-snapshot
Lower Bounds for Distributed Maximum-Finding Algorithms
inferredcites →https://doi.org/10.1145/321832.321838openalex-snapshot
A Combinatorial Problem Related to Multimodule Memory Organizations
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/69622.357194openalex-snapshot
An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
inferredcites →https://doi.org/10.1145/7531.7919openalex-snapshot
Electing a leader in a synchronous ring
inferredcites →https://doi.org/10.1145/800222.806747openalex-snapshot
Tight lower and upper bounds for some distributed algorithms for a complete network of processors
inferredcites →https://doi.org/10.1515/9780773573475-009openalex-snapshot
Sense of Direction and Communication Complexity in Distributed Networks
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.1006/jpdc.1996.0026openalex-snapshot
Optimal Elections in Labeled Hypercubes
inferred← citeshttps://doi.org/10.1006/jpdc.1997.1389openalex-snapshot
Optimal Distributed Algorithms in Unlabeled Tori and Chordal Rings
inferred← citeshttps://doi.org/10.1007/3-540-46784-x_21openalex-snapshot
Optimal Irreversible Dy namos in Chordal Rings
inferred← citeshttps://doi.org/10.1007/3-540-49477-4_23openalex-snapshot
Yet Another Modular Technique for Efficient Leader Election
inferred← citeshttps://doi.org/10.1007/3-540-53504-7_104openalex-snapshot
Electing a leader in a synchronous recursively scalable network
inferred← citeshttps://doi.org/10.1007/3-540-60609-2_3openalex-snapshot
Sense of direction in processor 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-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-003-0092-xopenalex-snapshot
Lower bounds for sense of direction in regular graphs
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.1007/s00453-013-9810-3openalex-snapshot
Random Walks, Bisections and Gossiping in Circulant Graphs
inferred← citeshttps://doi.org/10.1007/s00453-022-01068-xopenalex-snapshot
Leader Election in Well-Connected Graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90069-topenalex-snapshot
Towards optimal distributed election on chordal rings
inferred← citeshttps://doi.org/10.1016/0020-0255(94)90071-xopenalex-snapshot
A near-optimal multistage distributed algorithm for finding leaders in clustered chordal rings
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00031-8openalex-snapshot
Minimal sense of direction in regular networks
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00091-4openalex-snapshot
On the impact of sense of direction on message complexity
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00388-7openalex-snapshot
Optimal irreversible dynamos in chordal rings
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00569-3openalex-snapshot
Symmetry properties of chordal rings of degree 3
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00395-4openalex-snapshot
Sense of direction in distributed computing
inferred← citeshttps://doi.org/10.1080/00207169108804012openalex-snapshot
An improved election algorithm in chordal ring networks
inferred← citeshttps://doi.org/10.1109/12.660164openalex-snapshot
Optimal elections in faulty loop networks and applications
inferred← citeshttps://doi.org/10.1109/24.589920openalex-snapshot
A fault-tolerant protocol for election in chordal-ring networks with fail-stop processor failures
inferred← citeshttps://doi.org/10.1109/acit62805.2024.10877249openalex-snapshot
Maximize Leader Election Algorithm Performance in Bi-Directional Ring Networks With Both Links Down Between Two Nodes
inferred← citeshttps://doi.org/10.1109/ftcs.1994.315621openalex-snapshot
Optimal fault-tolerant leader election in chordal rings
inferred← citeshttps://doi.org/10.1109/ftdcs.1992.217503openalex-snapshot
An optimal distributed algorithm for failure-driven leader election in bounded-degree networks
inferred← citeshttps://doi.org/10.1109/icdcs.1994.302421openalex-snapshot
On the impact of sense of direction in arbitrary networks
inferred← citeshttps://doi.org/10.1109/ipdps.2006.1639545openalex-snapshot
Decontamination of chordal rings and tori
inferred← citeshttps://doi.org/10.1137/s0097539796310801openalex-snapshot
Complexity of Deciding Sense of Direction
inferred← citeshttps://doi.org/10.1142/s0129054107004838openalex-snapshot
DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS
inferred← citeshttps://doi.org/10.1142/s0129054198000131openalex-snapshot
TOPOLOGICAL CONSTRAINTS FOR SENSE OF DIRECTION
inferred← citeshttps://doi.org/10.1145/135419.135457openalex-snapshot
Leader election in complete networks
inferred← citeshttps://doi.org/10.2478/ausm-2014-0005openalex-snapshot
Leader election in synchronous networks
inferred← citeshttps://doi.org/10.5555/1898699.1898772openalex-snapshot
Decontamination of chordal rings and tori
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.