Mobile agents in distributed computing: network exploration
From MaRDI portal
Publication:4584899
zbMATH Open1394.68033MaRDI QIDQ4584899FDOQ4584899
Authors: Shantanu Das
Publication date: 4 September 2018
Full work available at URL: http://eatcs.org/beatcs/index.php/beatcs/article/view/27/23
Recommendations
Cited In (16)
- Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots
- Finding network resources by using mobile agents
- CADbots: algorithmic aspects of manipulating programmable matter with finite automata
- Locating and repairing faults in a network with mobile agents
- Beyond rings: gathering in 1-interval connected graphs
- On mobile agent verifiable problems
- Forming tile shapes with simple robots
- Model checking parameterised multi-token systems via the composition method
- Verification of agent navigation in partially-known environments
- Title not available (Why is that?)
- Exploration of dynamic tori by multiple agents
- Mobile Agents Implementing Local Computations in Graphs
- Shape recognition by a finite automaton robot
- An Algorithmic Theory of Mobile Agents
- Title not available (Why is that?)
- Exploration of dynamic ring networks by a single agent with the H-hops and S-time steps view
This page was built for publication: Mobile agents in distributed computing: network exploration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4584899)