On the public citation graph
Asynchronous Deterministic Rendezvous in Graphs
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.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.1007/3-540-44693-1_22openalex-snapshot
Gathering of Asynchronous Oblivious Robots with Limited Visibility
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-540-30551-4_56openalex-snapshot
Polynomial Deterministic Rendezvous in Arbitrary Graphs
inferredcites →https://doi.org/10.1007/978-3-540-39658-1_19openalex-snapshot
Deterministic Rendezvous in Graphs
inferredcites →https://doi.org/10.1007/b100809openalex-snapshot
The Theory of Search Games and Rendezvous
inferredcites →https://doi.org/10.1007/s00453-006-0074-2openalex-snapshot
Deterministic Rendezvous in Graphs
inferredcites →https://doi.org/10.1016/0196-6774(87)90018-6openalex-snapshot
Problems complete for deterministic logarithmic space
inferredcites →https://doi.org/10.1017/s0021900200028011openalex-snapshot
The rendezvous problem on discrete locations
inferredcites →https://doi.org/10.1057/jors.1992.89openalex-snapshot
Finding Your Kids When They Are Lost
inferredcites →https://doi.org/10.1109/icdcs.2003.1203510openalex-snapshot
Mobile agent rendezvous in a ring
inferredcites →https://doi.org/10.1109/sfcs.1979.34openalex-snapshot
Random walks, universal traversal sequences, and the complexity of maze problems
inferredcites →https://doi.org/10.1137/0406029openalex-snapshot
Collisions Among Random Walks on a Graph
inferredcites →https://doi.org/10.1137/s0363012993249195openalex-snapshot
The Rendezvous Search Problem
inferredcites →https://doi.org/10.1137/s0363012993260288openalex-snapshot
Rendezvous Search on the Line with Distinguishable Players
inferredcites →https://doi.org/10.1137/s0363012993260707openalex-snapshot
Rendezvous Search on the Line with Indistinguishable Players
inferredcites →https://doi.org/10.1137/s036301299427816xopenalex-snapshot
Minimax Rendezvous on the Line
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/100216.100266openalex-snapshot
Random walks on weighted graphs, and applications to on-line algorithms
inferredcites →https://doi.org/10.1145/276884.276925openalex-snapshot
Asymmetric rendezvous on the plane
inferredcites →https://doi.org/10.1145/73007.73043openalex-snapshot
A random polynomial time algorithm for approximating the volume of convex bodies
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.49.1.107.11191openalex-snapshot
Two Dimensional Rendezvous Search
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11940128_74openalex-snapshot
Gathering Asynchronous Oblivious Mobile Robots in a Ring
inferred← citeshttps://doi.org/10.1007/978-3-031-44274-2_22openalex-snapshot
Meeting Times of Non-atomic Random Walks
inferred← citeshttps://doi.org/10.1007/978-3-319-09620-9_25openalex-snapshot
Move-Optimal Partial Gathering of Mobile Agents in Asynchronous Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_52openalex-snapshot
Randomized Rendez-Vous with Limited Memory
inferred← citeshttps://doi.org/10.1007/978-3-642-11476-2_15openalex-snapshot
Black Hole Search in Directed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-13284-1_13openalex-snapshot
Periodic Data Retrieval Problem in Rings Containing a Malicious Host
inferred← citeshttps://doi.org/10.1007/978-3-642-13284-1_7openalex-snapshot
Asynchronous Deterministic Rendezvous in Bounded Terrains
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.010openalex-snapshot
How to meet in anonymous network
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.11.023openalex-snapshot
Uniform multi-agent deployment on a ring
inferred← citeshttps://doi.org/10.1137/1.9781611973075.3openalex-snapshot
How to meet asynchronously (almost) everywhere
inferred← citeshttps://doi.org/10.1145/1978782.1978789openalex-snapshot
Randomized rendezvous with limited memory
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.