On the public citation graph
Gap Theorems for Distributed Computation
0 signed · 32 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.1006/inco.1994.1002openalex-snapshot
The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case
inferredcites →https://doi.org/10.1007/bf01784021openalex-snapshot
Randomized function evaluation on a ring
inferredcites →https://doi.org/10.1007/bfb0028993openalex-snapshot
Distributed computing on transitive networks: The torus
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/0890-5401(87)90056-3openalex-snapshot
On the bit complexity of distributed computations in a ring with a leader
inferredcites →https://doi.org/10.1145/321450.321464openalex-snapshot
Computational Complexity of One-Tape Turing Machine Computations
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/inco.1994.1002openalex-snapshot
The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case
inferred← citeshttps://doi.org/10.1007/11945529_27openalex-snapshot
Computing on a Partially Eponymous Ring
inferred← citeshttps://doi.org/10.1007/bf01192691openalex-snapshot
Computing functions on asynchronous anonymous networks
inferred← citeshttps://doi.org/10.1007/s002240000081openalex-snapshot
Computing functions on asynchronous anonymous networks
inferred← citeshttps://doi.org/10.1007/s002240010007openalex-snapshot
On Recognizing a String on an Anonymous Ring
inferred← citeshttps://doi.org/10.1007/s00446-003-0091-yopenalex-snapshot
Hundreds of impossibility results for distributed computing
inferred← citeshttps://doi.org/10.1007/s00446-013-0202-3openalex-snapshot
Weak models of distributed computing, with connections to modal logic
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00197-2openalex-snapshot
A gap theorem for the anonymous torus
inferred← citeshttps://doi.org/10.1016/j.jpdc.2003.11.007openalex-snapshot
Sorting and election in anonymous asynchronous rings
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.1109/71.481599openalex-snapshot
Computing on anonymous networks. I. Characterizing the solvable cases
inferred← citeshttps://doi.org/10.1109/allerton.2009.5394487openalex-snapshot
Distributed anonymous function computation in information fusion and multiagent systems
inferred← citeshttps://doi.org/10.1109/ipdps.2000.845996openalex-snapshot
Sorting multisets in anonymous rings
inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536128openalex-snapshot
The space complexity of the leader election in anonymous networks
inferred← citeshttps://doi.org/10.1109/tac.2011.2163874openalex-snapshot
Distributed Anonymous Discrete Function Computation
inferred← citeshttps://doi.org/10.1137/s0097539700377293openalex-snapshot
Backward Consistency and Sense of Direction in Advanced Distributed Systems
inferred← citeshttps://doi.org/10.1145/1326554.1326557openalex-snapshot
Bit complexity of breaking and achieving symmetry in chains and rings
inferred← citeshttps://doi.org/10.1145/2332432.2332466openalex-snapshot
Weak models of distributed computing, with connections to modal logic
inferred← citeshttps://doi.org/10.1145/301250.301314openalex-snapshot
Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract)
inferred← citeshttps://doi.org/10.1145/301308.301357openalex-snapshot
Backward consistency and sense of direction in advanced distributed systems
inferred← citeshttps://doi.org/10.1145/3662158.3662784openalex-snapshot
Brief Announcement: Know Your Audience
inferred← citeshttps://doi.org/10.48550/arxiv.1004.2102openalex-snapshot
Distributed anonymous discrete function computation
inferred← citeshttps://doi.org/10.48550/arxiv.1009.6036openalex-snapshot
Efficient Information Aggregation Strategies for Distributed Control and Signal Processing
inferred← citeshttps://doi.org/10.5860/choice.33-0987openalex-snapshot
Introduction to distributed algorithms
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.