How to Meet in Anonymous Network

DOI10.1007/11780823_5MaRDI QIDQ3613643zbMATH OpenOpenAlexFDO

Authors Dariusz R. Kowalski, Adam Malinowski

Publication date 12 March 2009

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11780823_5

zbMATH Keywords

distributed algorithmsgatheringrendezvousmobile agentsanonymous networks

Mathematics Subject Classification ID

Distributed algorithms (68W15) Network protocols (68M12)

Recommendations

• How to meet in anonymous network
• Anonymous Meeting in Networks
• Anonymous meeting in networks
• Deterministic rendezvous in graphs

Cited in

(11)

• Deterministic polynomial approach in the plane
• Anonymous meeting in networks
• Quiescence of self-stabilizing gossiping among mobile agents in graphs
• Anonymous Meeting in Networks
• Fast rendezvous with advice
• How to meet in anonymous network
• Gathering despite mischief
• Price of asynchrony in mobile agents computing
• Rendezvous in networks in spite of delay faults
• Want to gather? No need to chatter!
• Faster Treasure Hunt and Better Strongly Universal Exploration Sequences

This page was built for publication: How to Meet in Anonymous Network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613643)