On the public citation graph

Leader Election for Anonymous Mobile Agents with Footprints

https://doi.org/10.2139/ssrn.5533231
0 signed · 20 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/3-540-51687-5_52openalex-snapshot
Electing a leader when processor identity numbers are not distinct (extended abstract)
inferredcites →https://doi.org/10.1007/978-3-030-11072-7_17openalex-snapshot
Deterministic Rendezvous Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-24727-2_8openalex-snapshot
Election and Local Computations on Edges
inferredcites →https://doi.org/10.1007/978-3-642-39693-9_1openalex-snapshot
Belief Manipulation: A Formal Model of Deceit in Message Passing Systems
inferredcites →https://doi.org/10.1007/s00446-011-0141-9openalex-snapshot
How to meet when you forget: log-space rendezvous in arbitrary graphs
inferredcites →https://doi.org/10.1007/s00446-013-0196-xopenalex-snapshot
Leader election for anonymous asynchronous agents in arbitrary networks
inferredcites →https://doi.org/10.1007/s00453-006-0074-2openalex-snapshot
Deterministic Rendezvous in Graphs
inferredcites →https://doi.org/10.1007/s00453-015-9982-0openalex-snapshot
Anonymous Meeting in Networks
inferredcites →https://doi.org/10.1007/s00453-018-0444-3openalex-snapshot
Impact of Knowledge on Election Time in Anonymous Networks
inferredcites →https://doi.org/10.1016/0196-6774(91)90002-gopenalex-snapshot
Better computing on the anonymous ring
inferredcites →https://doi.org/10.1016/j.dam.2011.01.020openalex-snapshot
Deterministic symmetric rendezvous with tokens in a synchronous torus
inferredcites →https://doi.org/10.1016/j.tcs.2008.02.010openalex-snapshot
How to meet in anonymous network
inferredcites →https://doi.org/10.1109/71.481599openalex-snapshot
Computing on anonymous networks. I. Characterizing the solvable cases
inferredcites →https://doi.org/10.1145/2601068openalex-snapshot
Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences
inferredcites →https://doi.org/10.1145/301308.301355openalex-snapshot
Computing anonymously with arbitrary knowledge
inferredcites →https://doi.org/10.1145/3039870openalex-snapshot
Time vs. Information Tradeoffs for Leader Election in Anonymous Trees
inferredcites →https://doi.org/10.1145/359024.359029openalex-snapshot
Decentralized extrema-finding in circular configurations of processors
inferredcites →https://doi.org/10.1145/48014.48247openalex-snapshot
Computing on an anonymous ring
inferredcites →https://doi.org/10.1145/69622.357194openalex-snapshot
An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
inferredcites →https://doi.org/10.1145/7531.7919openalex-snapshot
Electing a leader in a synchronous ring
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.