Principles of Distributed Systems
From MaRDI portal
Publication:5466239
DOI10.1007/B99477zbMATH Open1078.68564OpenAlexW2506502630MaRDI QIDQ5466239FDOQ5466239
Authors: Stefan Dobrev, P. Flocchini, G. Prencipe, N. 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
Recommendations
- Mobile search for a black hole in an anonymous ring
- scientific article; zbMATH DE number 2006651
- Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
- Tight bounds for black hole search with scattered agents in synchronous rings
- Searching for a black hole in arbitrary networks: optimal mobile agents protocols
RendezVousAsynchronousGatheringDistributed ComputingBlack HoleMobile AgentsRing NetworkAnonymousHarmful Host
Cited In (16)
- Fast rendezvous on a cycle by agents with different speeds
- Gathering in dynamic rings
- Deterministic symmetric rendezvous with tokens in a synchronous torus
- Deterministic symmetric rendezvous in arbitrary graphs: overcoming anonymity, failures and uncertainty
- Mobile search for a black hole in an anonymous ring
- Gathering of robots in a ring with mobile faults
- Black hole search in directed graphs
- Mobile Agent Rendezvous in a Ring Using Faulty Tokens
- Title not available (Why is that?)
- Hardness and approximation results for black hole search in arbitrary networks
- Improved periodic data retrieval in asynchronous rings with a faulty host
- Partial gathering of mobile agents in asynchronous unidirectional rings
- Ten Open Problems in Rendezvous Search
- Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
- Move-optimal partial gathering of mobile agents in asynchronous trees
- Black hole search with finite automata scattered in a synchronous torus
This page was built for publication: Principles of Distributed Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5466239)
