Theoretical Computer Science
The complexity of searching a graph
Journal of the ACM (JACM)
Recontamination does not help to search a graph
Journal of the ACM (JACM)
The vertex separation and search number of a graph
Information and Computation
Exploring unknown environments
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The power of a pebble: exploring and mapping directed graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Piecemeal graph exploration by a mobile robot
Information and Computation
Exploring unknown undirected graphs
Journal of Algorithms
Intrusion detection using autonomous agents
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on recent advances in intrusion detection systems
Capture of an intruder by mobile agents
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Optimal Graph Exploration without Good Maps
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Time Limited Blackbox Security: Protecting Mobile Agents From Malicious Hosts
Mobile Agents and Security
Protecting Mobile Agents Against Malicious Hosts
Mobile Agents and Security
Can we elect if we cannot compare?
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Sense of direction in distributed computing
Theoretical Computer Science - Special issue: Distributed computing
Mobile Agent Rendezvous in a Ring
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Tree exploration with little memory
Journal of Algorithms
Contiguous Search in the Hypercube for Capturing an Intruder
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Graph exploration by a finite automaton
Theoretical Computer Science - Mathematical foundations of computer science 2004
Networks
Cycling Through a Dangerous Network: A Simple Efficient Strategy for Black Hole Search
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Complexity of Searching for a Black Hole
Fundamenta Informaticae
Mobile Search for a Black Hole in an Anonymous Ring
Algorithmica
Journal of Graph Theory
The power of team exploration: two robots can learn unlabeled directed graphs
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Decontamination of chordal rings and tori
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Network decontamination with local immunization
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Searching for black-hole faults in a network using multiple agents
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Monotony properties of connected visible graph searching
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Mobile agent rendezvous: a survey
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Distributed chasing of network intruders
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Black hole search in asynchronous rings using tokens
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Searching for a black hole in tree networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Distributed exploration of an unknown graph
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Hardness and approximation results for black hole search in arbitrary graphs
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Approximation bounds for black hole search problems
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Effective elections for anonymous mobile agents
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Cleaning an arbitrary regular network with mobile agents
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Research note: Security issues related to mobile code and agent-based systems
Computer Communications
Locating and Repairing Faults in a Network with Mobile Agents
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
r3: Resilient Random Regular Graphs
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Locating and repairing faults in a network with mobile agents
Theoretical Computer Science
Hi-index | 0.01 |
Mobile Agents have been extensively studied for several years by researchers in Artificial Intelligence and in Software Engineering. They offer a simple and natural way to describe distributed settings where mobility is inherent, and an explicit and direct way to describe the entities of those settings, such as mobile code, software agents, viruses, robots, web crawlers, etc. Further, they allow to express immediately notions such as selfish behaviour, negotiation, cooperation, etc arising in the new computing environments. As a programming paradigm, they allow a new philosophy of protocol and software design, bound to have an impact as strong as that caused by that of object-oriented programming. As a computational paradigm, mobile agents systems are an immediate and natural extension of the traditional message-passing settings studied in distributed computing. In spite of all this, mobile agents systems have been largely ignored by the mainstream distributed computing community. It is only in the last few years that several researchers, some motivated by long investigated and well established problems in automata theory, computational complexity, and graph theory, have started to systematically explore this new and exciting distributed computational universe. In this paper we describe some interesting problems and solution techniques developed in this investigations.