Distributed algorithms. An intuitive approach
From MaRDI portal
Recommendations
Cited in
(26)- A derivation of distributed implementation of Warshall's algorithm
- Distributed algorithms in synchronous broadcasting networks
- Distributed algorithms. 11th international workshop, WDAG '97, September 24--26, 1997, Saarbrücken, Germany
- An automata-theoretic approach to the verification of distributed algorithms
- Model checking mobile ad hoc networks
- Fair termination for parameterized probabilistic concurrent systems
- Distributed Systems
- Design and Analysis of Distributed Algorithms
- A normalized form for FIFO protocols traces, application to the replay of mode-based protocols
- Distributed graph algorithms for computer networks
- Efficient distributed algorithms by using the archimedean time assumption
- scientific article; zbMATH DE number 40998 (Why is no real title available?)
- scientific article; zbMATH DE number 732976 (Why is no real title available?)
- scientific article; zbMATH DE number 1779716 (Why is no real title available?)
- scientific article; zbMATH DE number 839564 (Why is no real title available?)
- Patch graph rewriting
- Introduction to Distributed Self-Stabilizing Algorithms
- Distributed systems. An algorithmic approach
- Distributed computing through combinatorial topology
- Structural Information and Communication Complexity
- A note on the message complexity of Cidon's distributed depth-first search algorithm
- With a little help from your friends: semi-cooperative games via joker moves
- On the satisfiability of local first-order logics with data
- The complexity of the distributed constraint satisfaction problem
- Reachability in distributed memory automata
- The complexity of the distributed constraint satisfaction problem
This page was built for publication: Distributed algorithms. An intuitive approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2865941)
