Introduction to Distributed Algorithms

DOI10.1017/CBO9781139168724zbMath0961.68157OpenAlexW2136604606MaRDI QIDQ4763060

Publication date: 28 February 2001

Full work available at URL: https://doi.org/10.1017/cbo9781139168724

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Distributed algorithms (68W15)

Related Items (63)

Parallel and Distributed Algorithms in P Systems ⋮ Periodicity based decidable classes in a first order timed logic ⋮ Data Collection in Population Protocols with Non-uniformly Random Scheduler ⋮ Conflict Resolution in Multi-agent Systems with Typed Connections for Ontology Population ⋮ On the diversity of asynchronous communication ⋮ An anonymous self-stabilizing algorithm for 1-maximal independent set in trees ⋮ Randomised distributed MIS and colouring algorithms for rings with oriented edges in \(O(\sqrt{\log n})\) bit rounds ⋮ Cost distribution of the Chang-Roberts leader election algorithm and related problems ⋮ A leader election algorithm for dynamic networks with causal clocks ⋮ Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings ⋮ Self-stabilizing labeling and ranking in ordered trees ⋮ Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving ⋮ Analysis of a randomized rendezvous algorithm ⋮ Election in partially anonymous networks with arbitrary knowledge in message passing systems ⋮ A note on the message complexity of Cidon's distributed depth-first search algorithm ⋮ Fast leader election in anonymous rings with bounded expected delay ⋮ Self-stabilizing indulgent zero-degrading binary consensus ⋮ A self-stabilizing algorithm to maximal 2-packing with improved complexity ⋮ Scheduling optimization in coupling independent services as a grid transaction ⋮ Using asynchrony and zero degradation to speed up indulgent consensus protocols ⋮ Snap-stabilization and PIF in tree networks ⋮ A family of optimal termination detection algorithms ⋮ Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs ⋮ Unnamed Item ⋮ Conflict resolution in multi-agent systems with typed relations for ontology population ⋮ Optimizing the reliability of streaming applications under throughput constraints ⋮ Making Asynchronous Distributed Computations Robust to Channel Noise ⋮ An optimal bit complexity randomized distributed MIS algorithm ⋮ Mafia: A theoretical study of players and coalitions in a partial information environment ⋮ On the power of synchronization between two adjacent processes ⋮ Distributed snapshots foradhocnetwork systems ⋮ Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks ⋮ Snap-stabilization in message-passing systems ⋮ Tutorial on separation results in process calculi via leader election problems ⋮ Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds ⋮ Symmetric electoral systems for ambient calculi ⋮ Visualization of Distributed Algorithms Based on Graph Relabelling Systems1 1This work has been supported by the European TMR research network GETGRATS, and by the “Conseil Régional d' Aquitane”. ⋮ Graph Relabelling Systems ⋮ Making asynchronous distributed computations robust to noise ⋮ A modular framework for verifying versatile distributed systems ⋮ A self-stabilizing transformer for population protocols with covering ⋮ How to improve snap-stabilizing point-to-point communication space complexity? ⋮ Uniform election in trees and polyominoids ⋮ Multiagent approach to controlling distributed computing in a cluster grid system ⋮ Broadcast in the rendezvous model ⋮ Locally guided randomized elections in trees: The totally fair case ⋮ The first fully polynomial stabilizing algorithm for BFS tree construction ⋮ Snap-Stabilizing Waves in Anonymous Networks ⋮ Space-efficient uniform deployment of mobile agents in asynchronous unidirectional rings ⋮ Data collection in population protocols with non-uniformly random scheduler ⋮ Verifying Recurrence Properties in Self-stabilization by Checking the Absence of Finite Counterexamples ⋮ Snap-stabilizing tasks in anonymous networks ⋮ Graph labelings derived from models in distributed computing: A complete complexity classification ⋮ Message Lower Bounds via Efficient Network Synchronization ⋮ A New Polynomial Silent Stabilizing Spanning-Tree Construction Algorithm ⋮ An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract) ⋮ Fair Exchange Is Incomparable to Consensus ⋮ More efficient on-the-fly LTL verification with Tarjan's algorithm ⋮ Randomized local elections. ⋮ Analysis of fully distributed splitting and naming probabilistic procedures and applications ⋮ Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications ⋮ New solutions for disjoint paths in P systems ⋮ A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots

This page was built for publication: Introduction to Distributed Algorithms