scientific article; zbMATH DE number 6931781

zbMath1394.68017MaRDI QIDQ4584893

Euripides Markou

Publication date: 4 September 2018

Full work available at URL: http://eatcs.org/beatcs/index.php/beatcs/article/view/52/48

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexitynetworksdeterministic finite automatafault tolerancedistributed algorithmsmobile agentsgraph explorationblack-hole search

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Network protocols (68M12)

Related Items (5)

More agents may decrease global work: a case in butterfly decontamination ⋮ Improved periodic data retrieval in asynchronous rings with a faulty host ⋮ CADbots: algorithmic aspects of manipulating programmable matter with finite automata ⋮ Shape recognition by a finite automaton robot ⋮ On mobile agent verifiable problems

This page was built for publication: