On the public citation graph

Computing functions on asynchronous anonymous networks

0 signed · 34 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/jgt.3190090103openalex-snapshot
Factors and factorizations of graphs—a survey
inferredcites →https://doi.org/10.1007/bf02392606openalex-snapshot
Die Theorie der regulären graphs
inferredcites →https://doi.org/10.1007/bfb0032037openalex-snapshot
Computing boolean functions on anonymous networks
inferredcites →https://doi.org/10.1016/0022-0000(91)90002-mopenalex-snapshot
Two lower bounds in asynchronous distributed computation
inferredcites →https://doi.org/10.1016/0196-6774(91)90002-gopenalex-snapshot
Better computing on the anonymous ring
inferredcites →https://doi.org/10.1109/71.481599openalex-snapshot
Computing on anonymous networks. I. Characterizing the solvable cases
inferredcites →https://doi.org/10.1109/71.481600openalex-snapshot
Computing on anonymous networks. II. Decision and membership problems
inferredcites →https://doi.org/10.1137/0222028openalex-snapshot
Gap Theorems for Distributed Computation
inferredcites →https://doi.org/10.1145/323596.323598openalex-snapshot
Symmetry and similarity in distributed systems
inferredcites →https://doi.org/10.1145/48014.48247openalex-snapshot
Computing on an anonymous ring
inferredcites →https://doi.org/10.1145/62546.62568openalex-snapshot
Computing on an anonymous network
inferredcites →https://doi.org/10.1145/800141.804655openalex-snapshot
Local and global properties in networks of processors (Extended Abstract)
inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot
GRAPH THEORY

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118256107.ch18openalex-snapshot
Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/11864219_8openalex-snapshot
Groupings and Pairings in Anonymous Networks
inferred← citeshttps://doi.org/10.1007/11945529_27openalex-snapshot
Computing on a Partially Eponymous Ring
inferred← citeshttps://doi.org/10.1007/978-3-319-48314-6_3openalex-snapshot
Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry?
inferred← citeshttps://doi.org/10.1007/978-3-540-24727-2_8openalex-snapshot
Election and Local Computations on Edges
inferred← citeshttps://doi.org/10.1007/978-3-540-87779-0_4openalex-snapshot
Local Terminations and Distributed Computability in Anonymous Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-29344-3_31openalex-snapshot
Decidability Classes for Mobile Agents Computing
inferred← citeshttps://doi.org/10.1007/978-3-642-31104-8_18openalex-snapshot
On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-662-49529-2_10openalex-snapshot
On Mobile Agent Verifiable Problems
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/j.ic.2018.03.003openalex-snapshot
On mobile agent verifiable problems
inferred← citeshttps://doi.org/10.1016/j.jpdc.2017.04.003openalex-snapshot
Decidability classes for mobile agents computing
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.02.009openalex-snapshot
Leader election in plane cellular automata, only with left?right global convention
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.10.010openalex-snapshot
Computing on a partially eponymous ring
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.03.018openalex-snapshot
Distinguishing views in symmetric networks: A tight lower bound
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115397openalex-snapshot
Minimum algorithm sizes for the gathering and related problems of autonomous mobile robots
inferred← citeshttps://doi.org/10.1145/1835698.1835783openalex-snapshot
Distributed algorithms for edge dominating sets
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/301308.301355openalex-snapshot
Computing anonymously with arbitrary knowledge
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
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.