Fault-tolerant sequential scan (Q841615)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Fault-tolerant sequential scan	scientific article

Statements

scholarly article

0 references

Fault-tolerant sequential scan (English)

0 references

Paola Flocchini

0 references

0 references

0 references

Theory of Computing Systems

0 references

publication date

18 September 2009

0 references

zbMATH Keywords

execution cost

0 references

fault-tolerant sequential scan

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00224-007-9065-y

0 references

Exploring Unknown Environments

0 references

0 references

Searching for a Black Hole in Synchronous Tree Networks

0 references

Optimal graph exploration without good maps

0 references

Mobile search for a black hole in an anonymous ring

0 references

0 references

Relations between Concurrent-Write Models of Parallel Computation

0 references

Efficient parallel algorithms can be made robust

0 references

Efficient exploration of faulty trees

0 references

Exploring Unknown Undirected Graphs

0 references

Fault-tolerant broadcasting and gossiping in communication networks

0 references

Optimization of Reduced Dependencies for Synchronous Sequential Machines

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1007/S00224-007-9065-Y

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:841615

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q841615&oldid=38497007"