On the public citation graph
An improved upperbound for distributed election in bidirectional rings of processors
0 signed · 28 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-16078-7_70openalex-snapshot
New upperbounds for decentralized extrema-finding in a ring of processors
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/69622.357194openalex-snapshot
An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
inferredcites →https://doi.org/10.1515/9780773573475-003openalex-snapshot
New Upperbounds for Decentralized Extrema-Finding in a Ring of Processors
inferredcites →https://doi.org/10.2307/2283757openalex-snapshot
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
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/scj.4690220302openalex-snapshot
An experimental evaluation of leader election algorithms for ring networks
inferred← citeshttps://doi.org/10.1007/3-540-16078-7_70openalex-snapshot
New upperbounds for decentralized extrema-finding in a ring of processors
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-57271-6_40openalex-snapshot
A simple, efficient algorithm for maximum finding on rings
inferred← citeshttps://doi.org/10.1007/978-3-540-31856-9_48openalex-snapshot
Exact Quantum Algorithms for the Leader Election Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-58066-6_9openalex-snapshot
Distributed Control Algorithms (Selected Topics)
inferred← citeshttps://doi.org/10.1007/bfb0028991openalex-snapshot
Average number of messages for distributed leader finding in rings of processors
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/0020-0190(88)90193-7openalex-snapshot
Solvability of the asynchronous ranking problem
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90215-3openalex-snapshot
A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90208-1openalex-snapshot
Average number of messages for distributed leader-finding in rings of processors
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/0022-0000(91)90041-3openalex-snapshot
Some lower bound results for decentralized extrema-finding in rings of processors
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90162-bopenalex-snapshot
Exact average message complexity values for distributed election on bidirectional rings of processors
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.1080/00207169108804012openalex-snapshot
An improved election algorithm in chordal ring networks
inferred← citeshttps://doi.org/10.1109/icdcs.1989.37935openalex-snapshot
Message complexity of simple ring-based election algorithms-an empirical analysis
inferred← citeshttps://doi.org/10.1109/tc.2010.177openalex-snapshot
Efficient, Decentralized Computation of the Topology of Spatial Regions
inferred← citeshttps://doi.org/10.1145/2141938.2141939openalex-snapshot
Exact Quantum Algorithms for the Leader Election Problem
inferred← citeshttps://doi.org/10.48550/arxiv.0712.4213openalex-snapshot
Exact Quantum Algorithms for the Leader Election Problem
inferred← citeshttps://doi.org/10.70675/f2b08af0z087dz4606zb83bzfebc42fc84a9openalex-snapshot
Eventual Leader Elections in Dynamic Networks
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.