On the public citation graph

Compression of View on Anonymous Networks—Folded View—

0 signed · 31 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.1006/inco.1994.1075openalex-snapshot
Elections in Anonymous Networks
inferredcites →https://doi.org/10.1006/inco.1994.1086openalex-snapshot
Computing Boolean Functions on Anonymous Networks
inferredcites →https://doi.org/10.1006/jagm.1996.0817openalex-snapshot
Distributed Computing on Anonymous Hypercube Networks
inferredcites →https://doi.org/10.1007/11940128_73openalex-snapshot
Effective Elections for Anonymous Mobile Agents
inferredcites →https://doi.org/10.1007/3-540-61769-8openalex-snapshot
Distributed Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-31856-9_48openalex-snapshot
Exact Quantum Algorithms for the Leader Election Problem
inferredcites →https://doi.org/10.1007/bfb0022433openalex-snapshot
Distributed Algorithms
inferredcites →https://doi.org/10.1016/0166-218x(93)e0133-jopenalex-snapshot
Universal covers of graphs: Isomorphism to depth n − 1 implies isomorphism to all depths
inferredcites →https://doi.org/10.1016/s0012-365x(00)00455-6openalex-snapshot
Fibrations of graphs
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.1109/71.798313openalex-snapshot
Leader election problem on networks in which processor identity numbers are not distinct
inferredcites →https://doi.org/10.1145/1582716.1582796openalex-snapshot
Brief announcement
inferredcites →https://doi.org/10.1145/174652.174656openalex-snapshot
Tight lower bounds for probabilistic solitude verification on anonymous rings
inferredcites →https://doi.org/10.1145/301308.301355openalex-snapshot
Computing anonymously with arbitrary knowledge
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)

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-031-60603-8_1openalex-snapshot
History Trees and Their Applications
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-319-72050-0_7openalex-snapshot
On the Smallest Grain of Salt to Get a Unique Identity
inferred← citeshttps://doi.org/10.1016/j.ic.2016.01.005openalex-snapshot
Topology recognition with advice
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.1109/lics.2015.69openalex-snapshot
Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth
inferred← citeshttps://doi.org/10.1109/tpds.2013.232openalex-snapshot
Views in a Graph: To Which Depth Must Equality Be Checked?
inferred← citeshttps://doi.org/10.1145/2141938.2141939openalex-snapshot
Exact Quantum Algorithms for the Leader Election Problem
inferred← citeshttps://doi.org/10.1145/3837064openalex-snapshot
Optimal Computation in Anonymous Dynamic Networks
inferred← citeshttps://doi.org/10.26421/qic17.1-2-2openalex-snapshot
A fast exact quantum algorithm for solitude verification
inferred← citeshttps://doi.org/10.4086/cjtcs.2014.010openalex-snapshot
inferred← citeshttps://doi.org/10.48550/arxiv.1407.2511openalex-snapshot
Distinguishing Views in Symmetric Networks: A Tight Lower Bound
inferred← citeshttps://doi.org/10.48550/arxiv.1601.06040openalex-snapshot
Topology recognition with advice
inferred← citeshttps://doi.org/10.48550/arxiv.2101.01409openalex-snapshot
Revisiting the Role of Coverings in Anonymous Networks: Spanning Tree Construction and Topology Recognition
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.