On the public citation graph
Effective Elections for Anonymous Mobile Agents
0 signed · 40 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/jagm.1996.0817openalex-snapshot
Distributed Computing on Anonymous Hypercube Networks
inferredcites →https://doi.org/10.1007/11429647_10openalex-snapshot
Distributed Exploration of an Unknown Graph
inferredcites →https://doi.org/10.1007/978-3-540-24749-4_22openalex-snapshot
Digraphs Exploration with Little Memory
inferredcites →https://doi.org/10.1007/b100809openalex-snapshot
The Theory of Search Games and Rendezvous
inferredcites →https://doi.org/10.1007/bfb0028993openalex-snapshot
Distributed computing on transitive networks: The torus
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/j.tcs.2007.05.011openalex-snapshot
Map construction of unknown graphs by multiple agents
inferredcites →https://doi.org/10.1109/71.481599openalex-snapshot
Computing on anonymous networks. I. Characterizing the solvable cases
inferredcites →https://doi.org/10.1145/301308.301352openalex-snapshot
Comparison of initial conditions for distributed algorithms on anonymous networks
inferredcites →https://doi.org/10.1145/357195.357200openalex-snapshot
A Distributed Algorithm for Minimum-Weight Spanning Trees
inferredcites →https://doi.org/10.1145/77606.77610openalex-snapshot
A modular technique for the design of efficient distributed leader finding algorithms
inferredcites →https://doi.org/10.1145/777412.777469openalex-snapshot
Can we elect if we cannot compare?
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.1002/9781118135617.ch3openalex-snapshot
Distributed Security Algorithms for Mobile Agents
inferred← citeshttps://doi.org/10.1007/11947950_1openalex-snapshot
Distributed Security Algorithms by Mobile Agents
inferred← citeshttps://doi.org/10.1007/978-1-4614-6825-7_12openalex-snapshot
Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty
inferred← citeshttps://doi.org/10.1007/978-3-030-11072-7_16openalex-snapshot
Graph Explorations with Mobile Agents
inferred← citeshttps://doi.org/10.1007/978-3-030-11072-7_2openalex-snapshot
Moving and Computing Models: Agents
inferred← citeshttps://doi.org/10.1007/978-3-031-60603-8_10openalex-snapshot
Deterministic Leader Election for Stationary Programmable Matter with Common Direction
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-72951-8_13openalex-snapshot
Optimal Moves for Gossiping Among Mobile Agents
inferred← citeshttps://doi.org/10.1007/978-3-540-72951-8_23openalex-snapshot
Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents
inferred← citeshttps://doi.org/10.1007/978-3-540-75142-7_11openalex-snapshot
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
inferred← citeshttps://doi.org/10.1007/978-3-540-87779-0_9openalex-snapshot
Local Maps: New Insights into Mobile Agent Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-92221-6_29openalex-snapshot
Rendezvous of Mobile Agents When Tokens Fail Anytime
inferred← citeshttps://doi.org/10.1007/978-3-642-14162-1_43openalex-snapshot
Rendezvous of Mobile Agents without Agreement on Local Orientation
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.11.007openalex-snapshot
Move-optimal gossiping among mobile agents
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/ipdps.2008.4536128openalex-snapshot
The space complexity of the leader election in anonymous networks
inferred← citeshttps://doi.org/10.1109/tpds.2011.142openalex-snapshot
Compression of View on Anonymous Networks—Folded View—
inferred← citeshttps://doi.org/10.1142/s1469026809002436openalex-snapshot
COMBINING GENETIC PROGRAMMING AND MODEL-DRIVEN DEVELOPMENT
inferred← citeshttps://doi.org/10.1587/transinf.2018fcp0008openalex-snapshot
Partial Gathering of Mobile Agents in Arbitrary Networks
inferred← citeshttps://doi.org/10.20381/ruor-19839openalex-snapshot
Distributed computing with mobile agents: Solving rendezvous and related problems
inferred← citeshttps://doi.org/10.20381/ruor-3182openalex-snapshot
Efficient Mechanisms for Exploration of Dangerous Graphs and for Inter-agent Communication
inferred← citeshttps://doi.org/10.20381/ruor-5411openalex-snapshot
Black Hole Search in the Network and Subway Models
inferred← citeshttps://doi.org/10.22215/etd/2012-07408openalex-snapshot
DisJ- reactive distributed simulation in Java
inferred← citeshttps://doi.org/10.2478/ausm-2014-0005openalex-snapshot
Leader election in synchronous networks
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.