On mobile agent verifiable problems

DOI10.1016/j.ic.2018.03.003zbMath1391.68037OpenAlexW2804188203WikidataQ129752901 ScholiaQ129752901MaRDI QIDQ1753994

Evangelos Bampas, David Ilcinkas

Publication date: 30 May 2018

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2018.03.003

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An annotated bibliography on guaranteed graph searching
• Distributed chasing of network intruders
• Searching for a black hole in arbitrary networks: optimal mobile agents protocols
• Proof labeling schemes
• Locality and checkability in wait-free computing
• Anonymous networks
• Tree exploration with logarithmic memory
• Local Terminations and Distributed Computability in Anonymous Networks
• Unreliable failure detectors for reliable distributed systems
• What Can be Computed Locally?
• Computing functions on asynchronous anonymous networks
• Distributed Verification and Hardness of Distributed Approximation
• Universal dynamic synchronous self-stabilization
• What can be decided locally without identifiers?
• Towards a complexity theory for local distributed computing
• About the Termination Detection in the Asynchronous Message Passing Model
• On the Impact of Identifiers on Local Decision
• Distributed Verification Using Mobile Agents
• Fast distributed algorithms for testing graph properties

This page was built for publication: On mobile agent verifiable problems