On the public citation graph

Gathering Asynchronous Oblivious Mobile Robots in a Ring

https://doi.org/10.1007/11940128_74
0 signed · 33 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/11429647_20openalex-snapshot
On the Feasibility of Gathering by Autonomous Mobile Robots
inferredcites →https://doi.org/10.1007/11549345_24openalex-snapshot
Asynchronous Deterministic Rendezvous in Graphs
inferredcites →https://doi.org/10.1007/3-540-45061-0_90openalex-snapshot
Solving the Robots Gathering Problem
inferredcites →https://doi.org/10.1007/3-540-61769-8openalex-snapshot
Distributed Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-24698-5_60openalex-snapshot
Gathering Non-oblivious Mobile Robots
inferredcites →https://doi.org/10.1007/978-3-540-24698-5_62openalex-snapshot
Multiple Mobile Agent Rendezvous in a Ring
inferredcites →https://doi.org/10.1007/978-3-540-27796-5_8openalex-snapshot
Robot Convergence via Center-of-Gravity Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-30551-4_56openalex-snapshot
Polynomial Deterministic Rendezvous in Arbitrary Graphs
inferredcites →https://doi.org/10.1007/b100809openalex-snapshot
The Theory of Search Games and Rendezvous
inferredcites →https://doi.org/10.1007/b13632openalex-snapshot
Algorithms - ESA 2003
inferredcites →https://doi.org/10.1007/bfb0022433openalex-snapshot
Distributed Algorithms
inferredcites →https://doi.org/10.1007/s00453-006-0074-2openalex-snapshot
Deterministic Rendezvous in Graphs
inferredcites →https://doi.org/10.1016/j.tcs.2005.01.001openalex-snapshot
Gathering of asynchronous robots with limited visibility
inferredcites →https://doi.org/10.1016/j.tcs.2005.12.016openalex-snapshot
Asynchronous deterministic rendezvous in graphs
inferredcites →https://doi.org/10.1109/70.795787openalex-snapshot
Distributed memoryless point convergence algorithm for mobile robots with limited visibility
inferredcites →https://doi.org/10.1109/71.481599openalex-snapshot
Computing on anonymous networks. I. Characterizing the solvable cases
inferredcites →https://doi.org/10.1137/050631562openalex-snapshot
Erratum: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
inferredcites →https://doi.org/10.1137/050645221openalex-snapshot
Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
inferredcites →https://doi.org/10.1137/s009753979628292xopenalex-snapshot
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns

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-030-03232-6_23openalex-snapshot
Gracefully Degrading Gathering in Dynamic Rings
inferred← citeshttps://doi.org/10.1007/978-3-319-49259-9_5openalex-snapshot
Self-stabilizing Robots in Highly Dynamic Environments
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-77096-1_8openalex-snapshot
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots
inferred← citeshttps://doi.org/10.1007/978-3-642-22212-2_14openalex-snapshot
Asynchronous Mobile Robot Gathering from Symmetric Configurations without Global Multiplicity Detection
inferred← citeshttps://doi.org/10.1007/978-981-13-0680-8_2openalex-snapshot
Gathering in the Discrete Domain: State of the Art
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.11.023openalex-snapshot
Uniform multi-agent deployment on a ring
inferred← citeshttps://doi.org/10.1109/icdcs.2017.80openalex-snapshot
Computability of Perpetual Exploration in Highly Dynamic Rings
inferred← citeshttps://doi.org/10.1109/nbis.2011.55openalex-snapshot
Distributed Computing with Mobile Robots: An Introductory Survey
inferred← citeshttps://doi.org/10.20381/ruor-19839openalex-snapshot
Distributed computing with mobile agents: Solving rendezvous and related problems
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.5809openalex-snapshot
Practical Considerations and Applications for Autonomous Robot Swarms
inferred← citeshttps://doi.org/10.48550/arxiv.1612.05767openalex-snapshot
Computability of Perpetual Exploration in Highly Dynamic Rings
inferred← citeshttps://doi.org/10.48550/arxiv.1805.05137openalex-snapshot
Gracefully Degrading Gathering in Dynamic Rings
inferred← citeshttps://doi.org/10.70675/f1e1175fz2135z4a7bzba8cz07bb8651babfopenalex-snapshot
Graceful Degradation and Speculation for Robots in Highly Dynamic Environments
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.