Design and Analysis of Distributed Algorithms
From MaRDI portal
Publication:3415174
DOI10.1002/0470072644zbMath1115.68166OpenAlexW648150138MaRDI QIDQ3415174
Publication date: 15 January 2007
Full work available at URL: https://doi.org/10.1002/0470072644
Analysis of algorithms (68W40) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Distributed algorithms (68W15)
Related Items (33)
OPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENT ⋮ Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane ⋮ Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings ⋮ Deterministic geoleader election in disoriented anonymous systems ⋮ Improved deterministic leader election in diameter-two networks ⋮ Election in partially anonymous networks with arbitrary knowledge in message passing systems ⋮ Gathering of robots on anonymous grids and trees without multiplicity detection ⋮ Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ Network decontamination under \(m\)-immunity ⋮ Gathering robots in graphs: the central role of synchronicity ⋮ Distributed Graph Algorithms and their Complexity: An Introduction ⋮ Explicit Communication Among Stigmergic Robots ⋮ An optimal bit complexity randomized distributed MIS algorithm ⋮ Sublinear bounds for randomized leader election ⋮ Self-stabilizing repeated balls-into-bins ⋮ Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds ⋮ Location-oblivious distributed unit disk graph coloring ⋮ Move-optimal gossiping among mobile agents ⋮ About randomised distributed graph colouring and graph partition algorithms ⋮ Some problems in distributed computational geometry ⋮ On the Microscopic View of Time and Messages ⋮ An Algorithmic Theory of Mobile Agents ⋮ Understanding Distributed Program Behavior Using a Multicast Communication Scheme ⋮ Trading Bit, Message, and Time Complexity of Distributed Algorithms ⋮ Message Lower Bounds via Efficient Network Synchronization ⋮ An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract) ⋮ Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound ⋮ Linear time distributed swap edge algorithms ⋮ On the Complexity of Universal Leader Election ⋮ Back to the Coordinated Attack Problem ⋮ Optimal Gathering of Oblivious Robots in Anonymous Graphs ⋮ Convergecast and broadcast by power-aware mobile agents
This page was built for publication: Design and Analysis of Distributed Algorithms
