Principles of Distributed Systems

DOI10.1007/B99477zbMath1078.68564OpenAlexW2506502630WikidataQ57583987 ScholiaQ57583987MaRDI QIDQ5466239

Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro

Publication date: 24 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

RendezVousAsynchronousGatheringDistributed ComputingBlack HoleMobile AgentsRing NetworkAnonymousHarmful Host

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (13)

Hardness and approximation results for black hole search in arbitrary networks ⋮ Move-optimal partial gathering of mobile agents in asynchronous trees ⋮ Improved periodic data retrieval in asynchronous rings with a faulty host ⋮ Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty ⋮ Ten Open Problems in Rendezvous Search ⋮ Partial gathering of mobile agents in asynchronous unidirectional rings ⋮ Gathering of robots in a ring with mobile faults ⋮ Deterministic symmetric rendezvous with tokens in a synchronous torus ⋮ Mobile Agent Rendezvous in a Ring Using Faulty Tokens ⋮ Gathering in dynamic rings ⋮ Black Hole Search with Finite Automata Scattered in a Synchronous Torus ⋮ Black Hole Search in Directed Graphs ⋮ Fast rendezvous on a cycle by agents with different speeds

This page was built for publication: Principles of Distributed Systems