How to Meet in Anonymous Network

From MaRDI portal

Revision as of 04:18, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3613643

Jump to:navigation, search

DOI10.1007/11780823_5zbMath1222.68036OpenAlexW4245131660MaRDI QIDQ3613643

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

zbMATH Keywords

rendezvous distributed algorithms mobile agents gathering anonymous networks

Mathematics Subject Classification ID

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

Related Items (7)

Rendezvous in networks in spite of delay faults ⋮ Price of asynchrony in mobile agents computing ⋮ Fast rendezvous with advice ⋮ Faster Treasure Hunt and Better Strongly Universal Exploration Sequences ⋮ Quiescence of self-stabilizing gossiping among mobile agents in graphs ⋮ Unnamed Item ⋮ Deterministic polynomial approach in the plane

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3613643&oldid=17037727"