Local Maps: New Insights into Mobile Agent Algorithms
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2086375 (Why is no real title available?)
- A trade-off between information and communication in broadcast protocols
- Complexity of network synchronization
- Distributed Computing with Advice: Information Sensitivity of Graph Coloring
- Distributed Computing: A Locality-Sensitive Approach
- Distributed parallel computing using navigational programming
- Fast Deterministic Distributed Algorithms for Sparse Spanners
- Fast Distributed Construction of Smallk-Dominating Sets and Applications
- Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents
- General compact labeling schemes for dynamic trees
- Graph Searching with Advice
- Labeling Schemes with Queries
- Local MST computation with short advice
- Local Maps: New Insights into Mobile Agent Algorithms
- Locality in Distributed Graph Algorithms
- Messages versus messengers in distributed programming
- On the Complexity of Distributed Network Decomposition
- Oracle size, a new measure of difficulty for communication tasks
- Proof labeling schemes
- Randomized pursuit-evasion with limited visibility
- Rendezvous and election of mobile agents: Impact of sense of direction
- Simple and efficient network decomposition and synchronization
- Sparser: A Paradigm for Running Distributed Algorithms
- Structural Information and Communication Complexity
- Tree Exploration with an Oracle
- What Can be Computed Locally?
Cited in
(4)
This page was built for publication: Local Maps: New Insights into Mobile Agent Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540225)
