How to Meet in Anonymous Network

DOI10.1007/11780823_5zbMATH Open1222.68036OpenAlexW4245131660MaRDI QIDQ3613643FDOQ3613643

Adam Malinowski, Dariusz R. Kowalski

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

Recommendations

• How to meet in anonymous network
• Anonymous Meeting in Networks
• Anonymous meeting in networks
• Deterministic rendezvous in graphs
• How to meet asynchronously at polynomial cost

zbMATH Keywords

distributed algorithmsgatheringrendezvousmobile agentsanonymous networks

Mathematics Subject Classification ID

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

Cited In (9)

• Anonymous Meeting in Networks
• Deterministic polynomial approach in the plane
• Quiescence of self-stabilizing gossiping among mobile agents in graphs
• Fast rendezvous with advice
• How to meet in anonymous network
• Price of asynchrony in mobile agents computing
• Rendezvous in networks in spite of delay faults
• Title not available (Why is that?)
• 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)