On the public citation graph

Deterministic gathering with crash faults

https://doi.org/10.1002/net.21810
0 signed · 45 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.1002/nav.10011openalex-snapshot
Rendezvous search on labeled networks
inferredcites →https://doi.org/10.1002/nav.1044openalex-snapshot
Rendezvous search when marks are left at the starting points
inferredcites →https://doi.org/10.1002/net.21453openalex-snapshot
Deterministic rendezvous in networks: A comprehensive survey
inferredcites →https://doi.org/10.1007/11780823_5openalex-snapshot
How to Meet in Anonymous Network
inferredcites →https://doi.org/10.1007/3-540-61440-0_163openalex-snapshot
Agent rendezvous: A dynamic symmetry-breaking problem
inferredcites →https://doi.org/10.1007/978-3-319-49259-9_31openalex-snapshot
Searching for an Evader in an Unknown Graph by an Optimal Number of Searchers
inferredcites →https://doi.org/10.1007/978-3-540-78773-0_52openalex-snapshot
Randomized Rendez-Vous with Limited Memory
inferredcites →https://doi.org/10.1007/978-3-642-39212-2_47openalex-snapshot
Deterministic Polynomial Approach in the Plane
inferredcites →https://doi.org/10.1007/b100809openalex-snapshot
The Theory of Search Games and Rendezvous
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-014-0216-5openalex-snapshot
Deterministic polynomial approach in the plane
inferredcites →https://doi.org/10.1007/s00446-015-0259-2openalex-snapshot
Rendezvous in networks in spite of delay faults
inferredcites →https://doi.org/10.1007/s00446-016-0276-9openalex-snapshot
Byzantine gathering in 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.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.1016/j.tcs.2008.02.010openalex-snapshot
How to meet in anonymous network
inferredcites →https://doi.org/10.1017/s0021900200028011openalex-snapshot
The rendezvous problem on discrete locations
inferredcites →https://doi.org/10.1109/icdcs.2003.1203510openalex-snapshot
Mobile agent rendezvous in a ring
inferredcites →https://doi.org/10.1137/050645221openalex-snapshot
Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
inferredcites →https://doi.org/10.1137/100796534openalex-snapshot
Distributed Computing by Mobile Robots: Gathering
inferredcites →https://doi.org/10.1137/130931990openalex-snapshot
How to Meet Asynchronously at Polynomial Cost
inferredcites →https://doi.org/10.1137/s0363012993249195openalex-snapshot
The Rendezvous Search Problem
inferredcites →https://doi.org/10.1137/s0363012996314130openalex-snapshot
Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
inferredcites →https://doi.org/10.1145/1391289.1391291openalex-snapshot
Undirected connectivity in log-space
inferredcites →https://doi.org/10.1145/2438645.2438649openalex-snapshot
Delays Induce an Exponential Memory Gap for Rendezvous in Trees
inferredcites →https://doi.org/10.1145/2629656openalex-snapshot
Gathering Despite Mischief
inferredcites →https://doi.org/10.1145/276884.276925openalex-snapshot
Asymmetric rendezvous on the plane
inferredcites →https://doi.org/10.1145/93385.93409openalex-snapshot
Token management schemes and random walks yield self-stabilizing mutual exclusion
inferredcites →https://doi.org/10.1287/opre.47.6.974openalex-snapshot
Rendezvous Search on the Line
inferredcites →https://doi.org/10.1287/opre.49.1.107.11191openalex-snapshot
Two Dimensional Rendezvous Search
inferredcites →https://doi.org/10.5555/1283383.1283448openalex-snapshot
Deterministic rendezvous, treasure hunts and strongly universal exploration sequences

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-05529-5_6openalex-snapshot
Gathering of Mobile Agents in Asynchronous Byzantine Environments with Authenticated Whiteboards
inferred← citeshttps://doi.org/10.1007/978-3-030-11072-7_17openalex-snapshot
Deterministic Rendezvous Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-62401-9_10openalex-snapshot
Fast Byzantine Gathering with Visibility in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-69084-1_2openalex-snapshot
Self-stabilizing Rendezvous of Synchronous Mobile Agents in Graphs
inferred← citeshttps://doi.org/10.1007/s00446-022-00419-9openalex-snapshot
Byzantine gathering in polynomial time
inferred← citeshttps://doi.org/10.1016/j.artint.2019.02.001openalex-snapshot
Rendezvous in planar environments with obstacles and unknown initial distance
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.02.018openalex-snapshot
Gathering Anonymous, Oblivious Robots on a Grid
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114892openalex-snapshot
A further study on weak Byzantine gathering of mobile agents
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115553openalex-snapshot
Optimal gathering of robots in anonymous butterfly networks via leader election
inferred← citeshttps://doi.org/10.1145/3631461.3631551openalex-snapshot
A Further Study on Weak Byzantine Gathering of Mobile Agents
inferred← citeshttps://doi.org/10.1587/transinf.2019edp7311openalex-snapshot
Byzantine-Tolerant Gathering of Mobile Agents in Asynchronous Arbitrary Networks with Authenticated Whiteboards
inferred← citeshttps://doi.org/10.48550/arxiv.1709.00877openalex-snapshot
Crash tolerant gathering on grid by asynchronous oblivious robots
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.