Design and Analysis of Distributed Algorithms
From MaRDI portal
Recommendations
Cited in
(41)- Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
- Self-stabilizing repeated balls-into-bins
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
- Election in partially anonymous networks with arbitrary knowledge in message passing systems
- Gathering robots in graphs: the central role of synchronicity
- Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
- Move-optimal gossiping among mobile agents
- Convergecast and broadcast by power-aware mobile agents
- Message Lower Bounds via Efficient Network Synchronization
- Distributed algorithms. An intuitive approach
- Optimal gathering of oblivious robots in anonymous graphs
- Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model
- Trading bit, message, and time complexity of distributed algorithms
- An optimal bit complexity randomized distributed MIS algorithm (extended abstract)
- OPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENT
- Distributed graph algorithms for computer networks
- An Algorithmic Theory of Mobile Agents
- Understanding Distributed Program Behavior Using a Multicast Communication Scheme
- Deterministic geoleader election in disoriented anonymous systems
- Model of distributed computing system operation with time
- Analyse régionale des systèmes distribués
- On the microscopic view of time and messages
- scientific article; zbMATH DE number 929635 (Why is no real title available?)
- An introductory tutorial to concurrency-related distributed recursion
- Back to the coordinated attack problem
- Distributed graph algorithms and their complexity: an introduction
- Location-oblivious distributed unit disk graph coloring
- Explicit communication among stigmergic robots
- Do-all computing in distributed systems.
- On the Complexity of Universal Leader Election
- Improved deterministic leader election in diameter-two networks
- Singularly optimal randomized leader election
- An optimal bit complexity randomized distributed MIS algorithm
- About randomised distributed graph colouring and graph partition algorithms
- Some problems in distributed computational geometry
- Linear time distributed swap edge algorithms
- Gathering of robots on anonymous grids and trees without multiplicity detection
- Network decontamination under m-immunity
This page was built for publication: Design and Analysis of Distributed Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3415174)
