On the public citation graph

Computing on anonymous networks. II. Decision and membership problems

0 signed · 55 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.1007/bf02392606openalex-snapshot
Die Theorie der regulären 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/sfcs.1980.12openalex-snapshot
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
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/net.20432openalex-snapshot
Graph labelings derived from models in distributed computing: A complete complexity classification
inferred← citeshttps://doi.org/10.1007/11753810_35openalex-snapshot
Duplicate Address Detection in Wireless Ad Hoc Networks Using Wireless Nature
inferred← citeshttps://doi.org/10.1007/11814856_64openalex-snapshot
Dynamicity Aware Graph Relabeling Systems and the Constraint Based Synchronization: A Unifying Approach to Deal with Dynamic Networks
inferred← citeshttps://doi.org/10.1007/11917496_27openalex-snapshot
Graph Labelings Derived from Models in Distributed Computing
inferred← citeshttps://doi.org/10.1007/11945529_27openalex-snapshot
Computing on a Partially Eponymous Ring
inferred← citeshttps://doi.org/10.1007/978-3-319-09620-9_22openalex-snapshot
What Do We Need to Know to Elect in Networks with Unknown Participants?
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.1007/978-3-540-24727-2_8openalex-snapshot
Election and Local Computations on Edges
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-540-77096-1_22openalex-snapshot
On the Self-stabilization of Mobile Robots in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-87405-8_5openalex-snapshot
Labelled (Hyper)Graphs, Negotiations and the Naming Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-04355-0_35openalex-snapshot
The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash and Anonymity
inferred← citeshttps://doi.org/10.1007/978-3-642-15763-9_22openalex-snapshot
Anonymous Asynchronous Systems: The Case of Failure Detectors
inferred← citeshttps://doi.org/10.1007/978-3-642-38123-2_4openalex-snapshot
Leader Election Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-662-53426-7_13openalex-snapshot
Anonymity-Preserving Failure Detectors
inferred← citeshttps://doi.org/10.1007/bf01192691openalex-snapshot
Computing functions on asynchronous anonymous networks
inferred← citeshttps://doi.org/10.1007/bfb0053545openalex-snapshot
Minor searching, normal forms of graph relabelling: Two applications based on enumerations by graph relabelling
inferred← citeshttps://doi.org/10.1007/s00224-003-1062-1openalex-snapshot
Characterizations of Classes of Graphs Recognizable by Local Computations
inferred← citeshttps://doi.org/10.1007/s002240000081openalex-snapshot
Computing functions on asynchronous anonymous networks
inferred← citeshttps://doi.org/10.1007/s00446-012-0169-5openalex-snapshot
Anonymous asynchronous systems: the case of failure detectors
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.1007/s00446-017-0301-7openalex-snapshot
Anonymous obstruction-free (n, k)-set agreement with $$n-k+1$$ n - k + 1 atomic read/write registers
inferred← citeshttps://doi.org/10.1007/s00607-020-00825-6openalex-snapshot
Uniform reliable broadcast in anonymous distributed systems with fair lossy channels
inferred← citeshttps://doi.org/10.1007/s00607-022-01135-9openalex-snapshot
Uniform atomic broadcast and consensus in fully anonymous synchronous systems with crash failures
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.10.010openalex-snapshot
Computing on a partially eponymous ring
inferred← citeshttps://doi.org/10.1051/ita/2017007openalex-snapshot
Maintenance of a Spanning Tree For Dynamic Graphs by Mobile Agents and Local Computations
inferred← citeshttps://doi.org/10.1109/71.798313openalex-snapshot
Leader election problem on networks in which processor identity numbers are not distinct
inferred← citeshttps://doi.org/10.1109/aina.2010.19openalex-snapshot
Consensus in Anonymous Distributed Systems: Is There a Weakest Failure Detector?
inferred← citeshttps://doi.org/10.1109/cdc.2016.7798790openalex-snapshot
A tight bound on the Bernoulli trials network size estimator
inferred← citeshttps://doi.org/10.1109/ipdpsw.2015.23openalex-snapshot
Implementing Uniform Reliable Broadcast in Anonymous Distributed Systems with Fair Lossy Channels
inferred← citeshttps://doi.org/10.1109/tpds.2011.142openalex-snapshot
Compression of View on Anonymous Networks—Folded View—
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.1137/050631562openalex-snapshot
Erratum: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
inferred← citeshttps://doi.org/10.1137/s009753979628292xopenalex-snapshot
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
inferred← citeshttps://doi.org/10.1145/1582716.1582773openalex-snapshot
Brief announcement
inferred← citeshttps://doi.org/10.1145/1582716.1582796openalex-snapshot
Brief announcement
inferred← citeshttps://doi.org/10.1145/2019591.2019592openalex-snapshot
The Price of Anonymity
inferred← citeshttps://doi.org/10.1145/2141938.2141939openalex-snapshot
Exact Quantum Algorithms for the Leader Election Problem
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/3061640.3061653openalex-snapshot
SIROCCO 2016 Review
inferred← citeshttps://doi.org/10.20381/ruor-19839openalex-snapshot
Distributed computing with mobile agents: Solving rendezvous and related problems
inferred← citeshttps://doi.org/10.3233/fi-2010-266openalex-snapshot
Local Computations on Triangular Graphs
inferred← citeshttps://doi.org/10.3233/fi-2012-747openalex-snapshot
Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks
inferred← citeshttps://doi.org/10.4036/iis.2015.l.04openalex-snapshot
Distributed Graph Algorithms and their Complexity: An Introduction
inferred← citeshttps://doi.org/10.4086/cjtcs.2014.010openalex-snapshot
inferred← citeshttps://doi.org/10.48550/arxiv.0712.4213openalex-snapshot
Exact Quantum Algorithms for the Leader Election Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1310.2494openalex-snapshot
Algorithmes auto-stabilisants pour la construction d'arbres couvrants et la gestion d'entités autonomes
inferred← citeshttps://doi.org/10.70675/9cdd5f31z31e8z49e5z80ebz378be9413659openalex-snapshot
Average consensus in anonymous dynamic networks : An algorithmic approach
inferred← citeshttps://doi.org/10.70675/fb8e31eazf399z402az94cczd303d6bf24dfopenalex-snapshot
Impact des connaissances initiales sur la calculabilité distribuée
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.