On the public citation graph
Randomized function evaluation on a ring
0 signed · 24 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/bfb0040400openalex-snapshot
Better computing on the anonymous ring
inferredcites →https://doi.org/10.1016/0016-0032(52)90522-xopenalex-snapshot
Introduction to number theory
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/0196-6774(87)90027-7openalex-snapshot
A lower bound for probabilistic distributed algorithms
inferredcites →https://doi.org/10.1016/0890-5401(90)90004-2openalex-snapshot
Symmetry breaking in distributed networks
inferredcites →https://doi.org/10.1137/0218002openalex-snapshot
The Bit Complexity of Randomized Leader Election on a Ring
inferredcites →https://doi.org/10.1145/10590.10602openalex-snapshot
Gap theorems for distributed computing
inferredcites →https://doi.org/10.1145/10590.10603openalex-snapshot
On the bit complexity of distributed computations in a ring with a leader
inferredcites →https://doi.org/10.1145/10590.10604openalex-snapshot
Probabilistic solitude verification on a ring
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
inferredcites →https://doi.org/10.14288/1.0051952openalex-snapshot
Randomized distributed computing on rings
inferredcites →https://doi.org/10.1515/9780773573475-008openalex-snapshot
Notes on Distributed Algorithms in Unidirectional Rings
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1994.1002openalex-snapshot
The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case
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-36190-1_9openalex-snapshot
Performance Analysis of Asynchronous Circuits Using Markov Chains
inferred← citeshttps://doi.org/10.1007/3-540-54099-7_4openalex-snapshot
Spanning tree construction for nameless networks
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.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.1137/0222028openalex-snapshot
Gap Theorems for Distributed Computation
inferred← citeshttps://doi.org/10.1145/174652.174656openalex-snapshot
Tight lower bounds for probabilistic solitude verification on anonymous 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.