Local Maps: New Insights into Mobile Agent Algorithms
From MaRDI portal
Publication:3540225
DOI10.1007/978-3-540-87779-0_9zbMath1161.68332OpenAlexW1503268800MaRDI QIDQ3540225
Publication date: 20 November 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00271624/file/RR-6511.pdf
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Local MST computation with short advice
- Rendezvous and election of mobile agents: Impact of sense of direction
- Messages versus messengers in distributed programming
- Simple and efficient network decomposition and synchronization
- Distributed parallel computing using navigational programming
- General compact labeling schemes for dynamic trees
- A trade-off between information and communication in broadcast protocols
- Local Maps: New Insights into Mobile Agent Algorithms
- Fast Deterministic Distributed Algorithms for Sparse Spanners
- Complexity of network synchronization
- Locality in Distributed Graph Algorithms
- Sparser: A Paradigm for Running Distributed Algorithms
- Fast Distributed Construction of Smallk-Dominating Sets and Applications
- Distributed Computing: A Locality-Sensitive Approach
- What Can be Computed Locally?
- On the Complexity of Distributed Network Decomposition
- Proof labeling schemes
- Oracle size
- Graph Searching with Advice
- Labeling Schemes with Queries
- Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents
- Distributed Computing with Advice: Information Sensitivity of Graph Coloring
- Structural Information and Communication Complexity
- Tree Exploration with an Oracle
