Fault-tolerant sequential scan
From MaRDI portal
Publication:841615
DOI10.1007/s00224-007-9065-yzbMath1178.68087OpenAlexW2031025945MaRDI QIDQ841615
Paola Flocchini, Nicola Santoro, Andrzej Pelc
Publication date: 18 September 2009
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-007-9065-y
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal graph exploration without good maps
- Efficient exploration of faulty trees
- Mobile search for a black hole in an anonymous ring
- Efficient parallel algorithms can be made robust
- Relations between Concurrent-Write Models of Parallel Computation
- Exploring Unknown Undirected Graphs
- Exploring Unknown Environments
- Searching for a Black Hole in Synchronous Tree Networks
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
- Fault-tolerant broadcasting and gossiping in communication networks
This page was built for publication: Fault-tolerant sequential scan