How to meet when you forget: log-space rendezvous in arbitrary graphs
From MaRDI portal
Publication:1938363
DOI10.1007/s00446-011-0141-9zbMath1284.68066OpenAlexW1972775782MaRDI QIDQ1938363
Andrzej Pelc, Adrian Kosowski, Jurek Czyzowicz
Publication date: 4 February 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-011-0141-9
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Distributed systems (68M14)
Related Items (32)
Byzantine gathering in networks ⋮ Memory optimal dispersion by anonymous mobile robots ⋮ Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane ⋮ Rendezvous in networks in spite of delay faults ⋮ Byzantine gathering in polynomial time ⋮ Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks ⋮ Almost universal anonymous rendezvous in the plane ⋮ Fast rendezvous with advice ⋮ Rendezvous of heterogeneous mobile agents in edge-weighted networks ⋮ Deterministic rendezvous in infinite trees ⋮ Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty ⋮ Unnamed Item ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ Deterministic treasure hunt and rendezvous in arbitrary connected graphs ⋮ Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs ⋮ Byzantine Gathering in Networks with Authenticated Whiteboards ⋮ Gathering of robots in a ring with mobile faults ⋮ Memory optimal dispersion by anonymous mobile robots ⋮ Use of information, memory and randomization in asynchronous gathering ⋮ Leader election for anonymous asynchronous agents in arbitrary networks ⋮ Time versus space trade-offs for rendezvous in trees ⋮ How to meet asynchronously at polynomial cost ⋮ Deterministic Rendezvous with Detection Using Beeps ⋮ Time versus cost tradeoffs for deterministic rendezvous in networks ⋮ Synchronous robots vs asynchronous lights-enhanced robots on graphs ⋮ Asynchronous approach in the plane: a deterministic polynomial algorithm ⋮ Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry? ⋮ Deterministic Meeting of Sniffing Agents in the Plane ⋮ Deterministic rendezvous with different maps ⋮ Distinguishing views in symmetric networks: a tight lower bound ⋮ Deterministic polynomial approach in the plane ⋮ Anonymous meeting in networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gathering of asynchronous robots with limited visibility
- How to meet in anonymous network
- Computing Boolean functions on anonymous networks
- Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
- Universal traversal sequences with backtracking.
- Asynchronous deterministic rendezvous in graphs
- Deterministic rendezvous in graphs
- Delays Induce an Exponential Memory Gap for Rendezvous in Trees
- Computing anonymously with arbitrary knowledge
- Remarks on the Intrinsic Equations of Twisted Curves
- Deterministic Rendezvous in Trees with Little Memory
- Undirected connectivity in log-space
- Two Dimensional Rendezvous Search
- Computing on an anonymous ring
- Space Lower Bounds for Maze Threadability on Restricted Machines
- Finding Your Kids When They Are Lost
- Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
- Rendezvous search on a graph
- Rendezvous search when marks are left at the starting points
- Rendezvous search on labeled networks
- Rendezvous Search on the Line
- Minimax Rendezvous on the Line
- Tree exploration with little memory
- The Rendezvous Search Problem
- STACS 2004
- Randomized Rendez-Vous with Limited Memory
- The rendezvous problem on discrete locations
- LATIN 2004: Theoretical Informatics
This page was built for publication: How to meet when you forget: log-space rendezvous in arbitrary graphs
