How to meet in anonymous network

DOI10.1016/j.tcs.2008.02.010zbMath1144.68050MaRDI 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

rendezvous; distributed algorithms; mobile agents; gathering; anonymous networks

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

68M12: Network protocols

68W15: Distributed algorithms

Related Items

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

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