How to meet in anonymous network

DOI10.1016/j.tcs.2008.02.010zbMath1144.68050OpenAlexW2138881680MaRDI QIDQ930910

Dariusz R. Kowalski, Adam Malinowski

Publication date: 24 June 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.02.010

zbMATH Keywords

rendezvousdistributed algorithmsmobile agentsgatheringanonymous networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (25)

Byzantine gathering in networks ⋮ Memory optimal dispersion by anonymous mobile robots ⋮ Byzantine gathering in polynomial time ⋮ Almost universal anonymous rendezvous in the plane ⋮ Rendezvous of heterogeneous mobile agents in edge-weighted networks ⋮ How to meet when you forget: log-space rendezvous in arbitrary graphs ⋮ Deterministic rendezvous in infinite trees ⋮ Ten Open Problems in Rendezvous Search ⋮ Unnamed Item ⋮ Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains ⋮ On deterministic rendezvous at a node of agents with arbitrary velocities ⋮ Byzantine Gathering in Networks with Authenticated Whiteboards ⋮ Asynchronous deterministic rendezvous in bounded terrains ⋮ Memory optimal dispersion by anonymous mobile robots ⋮ The kissing problem: how to end a gathering when everyone kisses everyone else goodbye ⋮ Time versus space trade-offs for rendezvous in trees ⋮ How to meet asynchronously at polynomial cost ⋮ Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences ⋮ Time versus cost tradeoffs for deterministic rendezvous in networks ⋮ Classifying rendezvous tasks of arbitrary dimension ⋮ Synchronous Rendezvous for Location-Aware Agents ⋮ Asynchronous approach in the plane: a deterministic polynomial algorithm ⋮ Rendezvous in planar environments with obstacles and unknown initial distance ⋮ Deterministic rendezvous with different maps ⋮ Anonymous meeting in networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deterministic rendezvous in graphs
• Collisions Among Random Walks on a Graph
• Two Dimensional Rendezvous Search
• Problems complete for deterministic logarithmic space
• 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
• The Rendezvous Search Problem
• Mathematical Foundations of Computer Science 2005
• The rendezvous problem on discrete locations
• LATIN 2004: Theoretical Informatics

This page was built for publication: How to meet in anonymous network