Distributed Algorithms for Message-Passing Systems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 996442
- Fault-tolerant message-passing distributed systems. An algorithmic approach
- scientific article; zbMATH DE number 2090633
- Distributed systems. An algorithmic approach
- Distributed Systems
- On the message complexity of distributed problems
- Using message passing for distributed programming: proof rules and disciplines
- Message-passing algorithms for the verification of distributed protocols
Cited in
(30)- Distributed algorithms in synchronous broadcasting networks
- A symmetry-based splitting strategy for discretizable distance geometry problems
- Election in fully anonymous shared memory systems: tight space bounds and algorithms
- Strong eventual consistency of the collaborative editing framework WOOT
- A visit to mutual exclusion in seven dates
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
- Time-efficient read/write register in crash-prone asynchronous message-passing systems
- Crash-tolerant causal broadcast in \(O(n)\) messages
- A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring
- Atomic read/write memory in signature-free Byzantine asynchronous message-passing systems
- Distributed algorithms. An intuitive approach
- On the diversity of asynchronous communication
- Communication patterns and input patterns in distributed computing (invited talk)
- A message-routing strategy for multicomputer systems
- Distributed Computing: A Locality-Sensitive Approach
- Reasoning about knowledge and messages in asynchronous multi-agent systems
- Causal broadcast: how to forget?
- Transition scale-spaces: a computational theory for the discretized entorhinal cortex
- Introduction to Reliable Distributed Programming
- Parallel Processing and Applied Mathematics
- scientific article; zbMATH DE number 2205250 (Why is no real title available?)
- Do-all computing in distributed systems.
- Mathematical Foundations of Computer Science 2005
- Distributed computing through combinatorial topology
- On a Verification Framework for Certifying Distributed Algorithms: Distributed Checking and Consistency
- Optimal algorithms for synchronous Byzantine \(k\)-set agreement
- Optimal algorithms for synchronous Byzantine \(k\)-set agreement
- On certifying distributed algorithms: problem of local correctness
- Strong Eventual Consistency of the Collaborative Editing Framework WOOT
- Parallel algorithms for gossiping by mail
This page was built for publication: Distributed Algorithms for Message-Passing Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841748)
