On the public citation graph
Deterministic rendezvous in networks: A comprehensive survey
0 signed · 150 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/(sici)1097-0037(199810)32:3<165::aid-net1>3.0.co;2-iopenalex-snapshot
Sense of direction: Definitions, properties, and classes
inferredcites →https://doi.org/10.1007/11611257_26openalex-snapshot
Optimal Memory Rendezvous of Anonymous Mobile Agents in a Unidirectional Ring
inferredcites →https://doi.org/10.1007/11682462_60openalex-snapshot
Mobile Agent Rendezvous in a Synchronous Torus
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-45061-0_90openalex-snapshot
Solving the Robots Gathering Problem
inferredcites →https://doi.org/10.1007/3-540-45414-4_12openalex-snapshot
Mobile Search for a Black Hole in an Anonymous Ring
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-031-01999-9openalex-snapshot
The Mobile Agent Rendezvous Problem in the Ring
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_15openalex-snapshot
Mobile Agents Rendezvous When Tokens Fail
inferredcites →https://doi.org/10.1007/978-3-540-27860-3_6openalex-snapshot
Multiple Agents RendezVous in a Ring in Spite of a Black Hole
inferredcites →https://doi.org/10.1007/978-3-540-77566-9_20openalex-snapshot
The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring
inferredcites →https://doi.org/10.1007/978-3-540-87779-0_17openalex-snapshot
Deterministic Rendezvous in Trees with Little Memory
inferredcites →https://doi.org/10.1007/978-3-540-92221-6_28openalex-snapshot
Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring
inferredcites →https://doi.org/10.1007/978-3-540-95891-8_45openalex-snapshot
Asynchronous Deterministic Rendezvous on the Line
inferredcites →https://doi.org/10.1007/978-3-642-13284-1_8openalex-snapshot
Space-Optimal Rendezvous of Mobile Agents in Asynchronous Trees
inferredcites →https://doi.org/10.1007/978-3-642-13284-1_9openalex-snapshot
Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings
inferredcites →https://doi.org/10.1007/978-3-642-14162-1_42openalex-snapshot
Tell Me Where I Am So I Can Meet You Sooner
inferredcites →https://doi.org/10.1007/978-3-642-15763-9_28openalex-snapshot
Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids
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.1007/s00453-009-9361-9openalex-snapshot
Trade-offs Between the Size of Advice and Broadcasting Time in Trees
inferredcites →https://doi.org/10.1016/j.ic.2008.07.005openalex-snapshot
Tree exploration with advice
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.2007.04.023openalex-snapshot
Impossibility of gathering by a set of autonomous mobile robots
inferredcites →https://doi.org/10.1016/j.tcs.2007.09.032openalex-snapshot
Gathering asynchronous oblivious mobile robots in a ring
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/71.481599openalex-snapshot
Computing on anonymous networks. I. Characterizing the solvable cases
inferredcites →https://doi.org/10.1109/icdcs.2003.1203510openalex-snapshot
Mobile agent rendezvous in a ring
inferredcites →https://doi.org/10.1137/1.9781611973075.3openalex-snapshot
How to meet asynchronously (almost) everywhere
inferredcites →https://doi.org/10.1137/s0097539700377293openalex-snapshot
Backward Consistency and Sense of Direction in Advanced Distributed Systems
inferredcites →https://doi.org/10.1145/1248377.1248402openalex-snapshot
Local MST computation with short advice
inferredcites →https://doi.org/10.1145/1326554.1326555openalex-snapshot
Towards 3-query locally decodable codes of subexponential length
inferredcites →https://doi.org/10.1145/1391289.1391291openalex-snapshot
Undirected connectivity in log-space
inferredcites →https://doi.org/10.1145/1810479.1810524openalex-snapshot
Delays induce an exponential memory gap for rendezvous in trees
inferredcites →https://doi.org/10.1145/2312005.2312007openalex-snapshot
Time vs. space trade-offs for rendezvous in trees
inferredcites →https://doi.org/10.1287/opre.50.5.772.363openalex-snapshot
Rendezvous Search: A Personal Perspective
inferredcites →https://doi.org/10.2200/s00278ed1v01y201004dct001openalex-snapshot
The Mobile Agent Rendezvous Problem in the Ring
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.1002/net.21810openalex-snapshot
Deterministic gathering with crash faults
inferred← citeshttps://doi.org/10.1007/978-1-4614-6825-7_12openalex-snapshot
Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty
inferred← citeshttps://doi.org/10.1007/978-1-4614-6825-7_13openalex-snapshot
Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model
inferred← citeshttps://doi.org/10.1007/978-3-030-00030-1_8openalex-snapshot
Forming Tile Shapes with Simple Robots
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-03232-6_27openalex-snapshot
Brief Announcement: Feasibility of Weak Gathering in Connected-over-Time Dynamic Rings
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-10801-4_14openalex-snapshot
Gathering of Robots in a Grid with Mobile Faults
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_22openalex-snapshot
Computing by Programmable Particles
inferred← citeshttps://doi.org/10.1007/978-3-030-24922-9_11openalex-snapshot
Asynchronous Rendezvous with Different Maps
inferred← citeshttps://doi.org/10.1007/978-3-030-24922-9_4openalex-snapshot
Near-Gathering of Energy-Constrained Mobile Agents
inferred← citeshttps://doi.org/10.1007/978-3-030-44051-0_42openalex-snapshot
CADbots: Algorithmic Aspects of Manipulating Programmable Matter with Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-21017-4_17openalex-snapshot
Collaborative Dispersion by Silent Robots
inferred← citeshttps://doi.org/10.1007/978-3-031-40971-4_18openalex-snapshot
Preliminary Evaluation of Random Walk Based Rendezvous Search on Facebook Social Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-78538-2_17openalex-snapshot
Fast Flocking of Protesters on Street Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-03578-9_18openalex-snapshot
Optimal Gathering of Oblivious Robots in Anonymous Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-09620-9_23openalex-snapshot
Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-09620-9_24openalex-snapshot
Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-14472-6_18openalex-snapshot
Tradeoffs between Cost and Information for Rendezvous and Treasure Hunt
inferred← citeshttps://doi.org/10.1007/978-3-319-18173-8_9openalex-snapshot
MinMax-Distance Gathering on Given Meeting Points
inferred← citeshttps://doi.org/10.1007/978-3-319-28472-9_14openalex-snapshot
Gathering of Robots on Meeting-Points
inferred← citeshttps://doi.org/10.1007/978-3-319-28472-9_7openalex-snapshot
Deterministic Rendezvous with Detection Using Beeps
inferred← citeshttps://doi.org/10.1007/978-3-319-48314-6_13openalex-snapshot
Linear Search by a Pair of Distinct-Speed Robots
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/978-3-319-77510-4_2openalex-snapshot
Gathering a Swarm of Robots Through Shortest Paths
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_47openalex-snapshot
Deterministic Polynomial Approach in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_35openalex-snapshot
Fault-Tolerant Rendezvous in Networks
inferred← citeshttps://doi.org/10.1007/978-3-662-46018-4_4openalex-snapshot
Minimum-Traveled-Distance Gathering of Oblivious Robots over Given Meeting Points
inferred← citeshttps://doi.org/10.1007/978-3-662-46018-4_5openalex-snapshot
Fast Rendezvous with Advice
inferred← citeshttps://doi.org/10.1007/978-3-662-46078-8_16openalex-snapshot
Deterministic Rendezvous in Restricted Graphs
inferred← citeshttps://doi.org/10.1007/s00446-013-0196-xopenalex-snapshot
Leader election for anonymous asynchronous agents in arbitrary networks
inferred← citeshttps://doi.org/10.1007/s00446-013-0201-4openalex-snapshot
Time versus space trade-offs for rendezvous in trees
inferred← citeshttps://doi.org/10.1007/s00446-014-0216-5openalex-snapshot
Deterministic polynomial approach in the plane
inferred← citeshttps://doi.org/10.1007/s00446-014-0236-1openalex-snapshot
Distributed graph searching with a sense of direction
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-0278-7openalex-snapshot
Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
inferred← citeshttps://doi.org/10.1007/s00446-017-0293-3openalex-snapshot
Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
inferred← citeshttps://doi.org/10.1007/s00446-025-00489-5openalex-snapshot
Fast deterministic rendezvous in labeled lines
inferred← citeshttps://doi.org/10.1007/s00453-014-9892-6openalex-snapshot
Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks
inferred← citeshttps://doi.org/10.1007/s00453-015-9982-0openalex-snapshot
Anonymous Meeting in Networks
inferred← citeshttps://doi.org/10.1007/s00453-018-0447-0openalex-snapshot
Linear Search by a Pair of Distinct-Speed Robots
inferred← citeshttps://doi.org/10.1007/s00453-023-01122-2openalex-snapshot
Almost Universal Anonymous Rendezvous in the Plane
inferred← citeshttps://doi.org/10.1007/s00453-024-01286-5openalex-snapshot
Symmetry Breaking in the Plane
inferred← citeshttps://doi.org/10.1007/s11047-019-09774-2openalex-snapshot
Forming tile shapes with simple robots
inferred← citeshttps://doi.org/10.1016/j.ic.2018.03.003openalex-snapshot
On mobile agent verifiable problems
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.jcss.2017.10.005openalex-snapshot
Use of information, memory and randomization in asynchronous gathering
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.06.001openalex-snapshot
Deterministic rendezvous with different maps
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103829openalex-snapshot
Balanced dispersion on time-varying dynamic graphs
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.jpdc.2017.04.003openalex-snapshot
Decidability classes for mobile agents computing
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.2015.09.025openalex-snapshot
Fast rendezvous with advice
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.05.002openalex-snapshot
Gathering of robots in a ring with mobile faults
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.06.045openalex-snapshot
On asynchronous rendezvous in general graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.10.008openalex-snapshot
Near-gathering of energy-constrained mobile agents
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.1088/1367-2630/acb22dopenalex-snapshot
Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks
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.1103/physreva.109.042201openalex-snapshot
Quantum strategies for rendezvous and domination tasks on graphs with mobile agents
inferred← citeshttps://doi.org/10.1109/cdc.2014.7039604openalex-snapshot
Consensus under time-delayed information on states and network
inferred← citeshttps://doi.org/10.1109/icdcs.2014.44openalex-snapshot
Deterministic Blind Rendezvous in Cognitive Radio Networks
inferred← citeshttps://doi.org/10.1109/icdcs47774.2020.00030openalex-snapshot
Fast Neighborhood Rendezvous
inferred← citeshttps://doi.org/10.1109/ipdpsw.2013.89openalex-snapshot
A unified approach for different tasks on rings in robot-based computing systems
inferred← citeshttps://doi.org/10.1109/tcns.2024.3432251openalex-snapshot
Rendezvous Control for a Double-Integrator Multiparticle System on Lorentz Group $SO(1,1)$
inferred← citeshttps://doi.org/10.1109/tpds.2013.259openalex-snapshot
Randomized Gathering of Mobile Agents in Anonymous Unidirectional Ring Networks
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.1142/s012905411750006xopenalex-snapshot
Deterministic Rendezvous with Detection Using Beeps
inferred← citeshttps://doi.org/10.1142/s0129626421500201openalex-snapshot
Beyond Rings: Gathering in 1-Interval Connected Graphs
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/3350755.3400283openalex-snapshot
Almost Universal Anonymous Rendezvous in the Plane
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.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.2021edp7104openalex-snapshot
Fast Neighborhood Rendezvous
inferred← citeshttps://doi.org/10.17760/d20009303openalex-snapshot
Dynamic discovery in wireless networks
inferred← citeshttps://doi.org/10.17760/d20323930openalex-snapshot
Algorithms for asymmetrically constrained rendezvous on networks
inferred← citeshttps://doi.org/10.22215/etd/2021-14519openalex-snapshot
Search and Rendezvous by Mobile Robots in Continuous Domains
inferred← citeshttps://doi.org/10.3233/fi-2018-1684openalex-snapshot
Deterministic Meeting of Sniffing Agents in the Plane
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.1506.07952openalex-snapshot
Tradeoffs Between Cost and Information for Rendezvous and Treasure Hunt
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.1709.06214openalex-snapshot
Deterministic rendezvous with detection using beeps
inferred← citeshttps://doi.org/10.48550/arxiv.1810.03120openalex-snapshot
Using Time to Break Symmetry: Universal Deterministic Anonymous Rendezvous
inferred← citeshttps://doi.org/10.48550/arxiv.1811.06420openalex-snapshot
Latecomers Help to Meet: Deterministic Anonymous Gathering 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
inferred← citeshttps://doi.org/10.70675/58e2747az6a79z40dezb604zbcda2fb26d19openalex-snapshot
Algorithms for deterministic parallel graph exploration
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.