Introduction to Distributed Algorithms
From MaRDI portal
Cited in
(65)- Self-stabilizing labeling and ranking in ordered trees
- New solutions for disjoint paths in P systems
- Randomized local elections.
- Visualization of distributed algorithms based on graph relabelling systems
- Analysis of fully distributed splitting and naming probabilistic procedures and applications
- A self-stabilizing transformer for population protocols with covering
- A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots
- Symmetric electoral systems for ambient calculi
- An optimal bit complexity randomized distributed MIS algorithm (extended abstract)
- Conflict resolution in multi-agent systems with typed relations for ontology population
- Graph relabelling systems: a tool for encoding, proving, studying and visualizing distributed algorithms
- Snap-stabilization in message-passing systems
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds
- Uniform election in trees and polyominoids
- How to improve snap-stabilizing point-to-point communication space complexity?
- Data Collection in Population Protocols with Non-uniformly Random Scheduler
- Election in partially anonymous networks with arbitrary knowledge in message passing systems
- Fair Exchange Is Incomparable to Consensus
- Graph labelings derived from models in distributed computing: A complete complexity classification
- Making asynchronous distributed computations robust to noise
- A modular framework for verifying versatile distributed systems
- Analysis of a randomized rendezvous algorithm
- Introduction to Reliable and Secure Distributed Programming
- 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
- Cost distribution of the Chang-Roberts leader election algorithm and related problems
- scientific article; zbMATH DE number 732976 (Why is no real title available?)
- Message Lower Bounds via Efficient Network Synchronization
- Locally guided randomized elections in trees: The totally fair case
- Snap-stabilization and PIF in tree networks
- On the diversity of asynchronous communication
- Periodicity based decidable classes in a first order timed logic
- Conflict resolution in multi-agent systems with typed connections for ontology population
- Tutorial on separation results in process calculi via leader election problems
- Distributed snapshots for ad hoc network systems
- Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs
- A note on the message complexity of Cidon's distributed depth-first search algorithm
- Multiagent approach to controlling distributed computing in a cluster grid system
- scientific article; zbMATH DE number 7453194 (Why is no real title available?)
- Broadcast in the rendezvous model
- The first fully polynomial stabilizing algorithm for BFS tree construction
- A family of optimal termination detection algorithms
- Snap-stabilizing tasks in anonymous networks
- Randomised distributed MIS and colouring algorithms for rings with oriented edges in \(O(\sqrt{\log n})\) bit rounds
- Verifying recurrence properties in self-stabilization by checking the absence of finite counterexamples
- Self-stabilizing indulgent zero-degrading binary consensus
- Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings
- Analysis of fully distributed splitting and naming probabilistic procedures and applications (extended abstract)
- Fast leader election in anonymous rings with bounded expected delay
- Data collection in population protocols with non-uniformly random scheduler
- An optimal bit complexity randomized distributed MIS algorithm
- Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks
- A new polynomial silent stabilizing spanning-tree construction algorithm
- An anonymous self-stabilizing algorithm for 1-maximal independent set in trees
- A leader election algorithm for dynamic networks with causal clocks
- Space-efficient uniform deployment of mobile agents in asynchronous unidirectional rings
- Optimizing the reliability of streaming applications under throughput constraints
- Mafia: A theoretical study of players and coalitions in a partial information environment
- Parallel and distributed algorithms in P systems
- On the power of synchronization between two adjacent processes
- Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving
- Making Asynchronous Distributed Computations Robust to Channel Noise
- More efficient on-the-fly LTL verification with Tarjan's algorithm
- Snap-Stabilizing Waves in Anonymous Networks
This page was built for publication: Introduction to Distributed Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4763060)
