On the public citation graph
Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences
0 signed · 96 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.1007/978-3-540-30551-4_56openalex-snapshot
Polynomial Deterministic Rendezvous in Arbitrary Graphs
inferredcites →https://doi.org/10.1007/978-3-540-77120-3_48openalex-snapshot
Faster Treasure Hunt and Better Strongly Universal Exploration Sequences
inferredcites →https://doi.org/10.1007/s00453-006-0074-2openalex-snapshot
Deterministic Rendezvous in Graphs
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.1016/s0022-0000(02)00023-5openalex-snapshot
Universal traversal sequences with backtracking
inferredcites →https://doi.org/10.1109/18.265501openalex-snapshot
Privacy, additional information and communication
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.1145/1330332.1330338openalex-snapshot
On the Existence of Unconditionally Privacy-Preserving Auction Protocols
inferredcites →https://doi.org/10.1145/1391289.1391291openalex-snapshot
Undirected connectivity in log-space
inferredcites →https://doi.org/10.1145/62212.62214openalex-snapshot
Multiparty unconditionally secure protocols
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.8055openalex-snapshot
Fast gathering despite a linear number of weakly Byzantine agents†
inferred← citeshttps://doi.org/10.1002/net.22075openalex-snapshot
Impact of knowledge on the cost of treasure hunt in trees
inferred← citeshttps://doi.org/10.1007/978-3-030-01325-7_14openalex-snapshot
Symmetric Rendezvous with Advice: How to Rendezvous in a Disk
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-11072-7_20openalex-snapshot
Mobile Agents on Dynamic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-24922-9_14openalex-snapshot
Evacuating Two Robots from a Disk: A Second Cut
inferred← citeshttps://doi.org/10.1007/978-3-030-67899-9_34openalex-snapshot
Memory Optimal Dispersion by Anonymous Mobile Robots
inferred← citeshttps://doi.org/10.1007/978-3-030-79527-6_13openalex-snapshot
Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-86838-3_24openalex-snapshot
Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-81404-4_9openalex-snapshot
Faster Leader Election and Its Applications for Mobile Agents with Parameter Advice
inferred← citeshttps://doi.org/10.1007/978-3-031-91736-3_23openalex-snapshot
Self-stabilizing Graph Exploration by a Single Agent
inferred← citeshttps://doi.org/10.1007/978-3-032-11127-2_11openalex-snapshot
Computing Tree Structures in Anonymous Graphs via Mobile Agents
inferred← citeshttps://doi.org/10.1007/978-3-319-25258-2_13openalex-snapshot
Byzantine Gathering in Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-25258-2_23openalex-snapshot
Treasure Hunt with Advice
inferred← citeshttps://doi.org/10.1007/978-3-319-48314-6_14openalex-snapshot
Deterministic Meeting of Sniffing Agents in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-319-51963-0_7openalex-snapshot
Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-53925-6_9openalex-snapshot
Byzantine Gathering in Networks with Authenticated Whiteboards
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/978-3-319-72050-0_20openalex-snapshot
Gathering in Dynamic Rings
inferred← citeshttps://doi.org/10.1007/s00446-015-0253-8openalex-snapshot
Time versus cost tradeoffs for deterministic rendezvous in networks
inferred← citeshttps://doi.org/10.1007/s00446-015-0259-2openalex-snapshot
Rendezvous in networks in spite of delay faults
inferred← citeshttps://doi.org/10.1007/s00446-016-0276-9openalex-snapshot
Byzantine gathering in networks
inferred← citeshttps://doi.org/10.1007/s00446-018-0338-2openalex-snapshot
Asynchronous approach in the plane: a deterministic polynomial algorithm
inferred← citeshttps://doi.org/10.1007/s00446-022-00419-9openalex-snapshot
Byzantine gathering in polynomial time
inferred← citeshttps://doi.org/10.1007/s00446-025-00489-5openalex-snapshot
Fast deterministic rendezvous in labeled lines
inferred← citeshttps://doi.org/10.1007/s00453-015-9982-0openalex-snapshot
Anonymous Meeting in Networks
inferred← citeshttps://doi.org/10.1007/s00453-020-00724-4openalex-snapshot
Deterministic Treasure Hunt in the Plane with Angular Hints
inferred← citeshttps://doi.org/10.1007/s00453-022-00995-zopenalex-snapshot
Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots
inferred← citeshttps://doi.org/10.1007/s00453-023-01122-2openalex-snapshot
Almost Universal Anonymous Rendezvous in the Plane
inferred← citeshttps://doi.org/10.1016/j.dam.2023.07.005openalex-snapshot
Memory optimal dispersion by anonymous mobile robots
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104705openalex-snapshot
Advice complexity of treasure hunt in geometric terrains
inferred← citeshttps://doi.org/10.1016/j.ic.2023.105049openalex-snapshot
Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.01.003openalex-snapshot
On deterministic rendezvous at a node of agents with arbitrary velocities
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.04.006openalex-snapshot
Reaching a target in the plane with no information
inferred← citeshttps://doi.org/10.1016/j.jpdc.2015.06.004openalex-snapshot
Tradeoffs between cost and information for rendezvous and treasure hunt
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.12.023openalex-snapshot
Price of asynchrony in mobile agents computing
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.011openalex-snapshot
Pebble guided optimal treasure hunt in anonymous graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114313openalex-snapshot
Deterministic rendezvous in infinite trees
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.115395openalex-snapshot
Sniffing helps to meet: Deterministic rendezvous of anonymous agents in the grid
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115578openalex-snapshot
Faster leader election via mobile agents and its applications
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116073openalex-snapshot
Pebble guided rendezvous despite fault
inferred← citeshttps://doi.org/10.1088/1367-2630/ad78f8openalex-snapshot
Quantum-assisted rendezvous on graphs: explicit algorithms and quantum computer simulations
inferred← citeshttps://doi.org/10.1109/access.2024.3444314openalex-snapshot
Fast Marching Based Rendezvous Path Planning for a Team of Heterogeneous Vehicles
inferred← citeshttps://doi.org/10.1109/candarw57323.2022.00067openalex-snapshot
Gathering despite a linear number of weakly Byzantine agents
inferred← citeshttps://doi.org/10.1109/ipdps49936.2021.00103openalex-snapshot
Byzantine Dispersion on Graphs
inferred← citeshttps://doi.org/10.1109/ipdps54959.2023.00015openalex-snapshot
Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots
inferred← citeshttps://doi.org/10.1109/tc.2015.2389799openalex-snapshot
The Telephone Coordination Game Revisited: From Random to Deterministic Algorithms
inferred← citeshttps://doi.org/10.1137/130931990openalex-snapshot
How to Meet Asynchronously at Polynomial Cost
inferred← citeshttps://doi.org/10.1137/20m1362899openalex-snapshot
Want to Gather? No Need to Chatter!
inferred← citeshttps://doi.org/10.1145/1810479.1810524openalex-snapshot
Delays induce an exponential memory gap for rendezvous in trees
inferred← citeshttps://doi.org/10.1145/2312005.2312007openalex-snapshot
Time vs. space trade-offs for rendezvous in trees
inferred← citeshttps://doi.org/10.1145/2484239.2484245openalex-snapshot
How to meet asynchronously at polynomial cost
inferred← citeshttps://doi.org/10.1145/2611462.2611473openalex-snapshot
Time versus cost tradeoffs for deterministic rendezvous in networks
inferred← citeshttps://doi.org/10.1145/3293611.3331608openalex-snapshot
Symmetry Breaking in the Plane
inferred← citeshttps://doi.org/10.1145/3350755.3400283openalex-snapshot
Almost Universal Anonymous Rendezvous in the Plane
inferred← citeshttps://doi.org/10.1145/3519270.3538470openalex-snapshot
Brief Announcement: Gathering Despite a Linear Number of Weakly Byzantine Agents
inferred← citeshttps://doi.org/10.1145/3588437openalex-snapshot
Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs
inferred← citeshttps://doi.org/10.1145/3631461.3631551openalex-snapshot
A Further Study on Weak Byzantine Gathering of Mobile Agents
inferred← citeshttps://doi.org/10.1145/3631461.3632310openalex-snapshot
Dispersion, Capacitated Nodes, and the Power of a Trusted Shepherd
inferred← citeshttps://doi.org/10.1145/3732772.3733537openalex-snapshot
Brief Announcement: Optimal Deterministic Rendezvous in Labeled Lines
inferred← citeshttps://doi.org/10.1145/3816782.3819209openalex-snapshot
Universal Deterministic Symmetry Breaking Between Anonymous Agents in Networks
inferred← citeshttps://doi.org/10.1587/transinf.2017fcp0008openalex-snapshot
Byzantine-Tolerant Gathering of Mobile Agents in Arbitrary Networks with Authenticated Whiteboards
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.1587/transinf.2021fcp0011openalex-snapshot
Weakly Byzantine Gathering with a Strong Team
inferred← citeshttps://doi.org/10.17760/d20323930openalex-snapshot
Algorithms for asymmetrically constrained rendezvous on networks
inferred← citeshttps://doi.org/10.2139/ssrn.5533231openalex-snapshot
Leader Election for Anonymous Mobile Agents with Footprints
inferred← citeshttps://doi.org/10.22215/etd/2021-14519openalex-snapshot
Search and Rendezvous by Mobile Robots in Continuous Domains
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2021.36openalex-snapshot
Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1111.0321openalex-snapshot
Anonymous Meeting in Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1301.7119openalex-snapshot
How to Meet Asynchronously at Polynomial Cost
inferred← citeshttps://doi.org/10.48550/arxiv.1504.01623openalex-snapshot
Byzantine Gathering in Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1508.02471openalex-snapshot
Time Versus Cost Tradeoffs for Deterministic Rendezvous in Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1902.06090openalex-snapshot
Cost vs. Information Tradeoffs for Treasure Hunt in the Plane
inferred← citeshttps://doi.org/10.48550/arxiv.2005.00880openalex-snapshot
Almost Universal Anonymous Rendezvous in the Plane
inferred← citeshttps://doi.org/10.70675/0920326ez9dd5z4d4bz983dz84d910d3fdb7openalex-snapshot
On the Deterministic Gathering of Mobile Agents
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.