Reaching Agreement in the Presence of Faults
From MaRDI portal
Publication:3873545
Cited in
(only showing first 100 items - show all)- A formal model of asynchronous communication and its use in mechanically verifying a biphase mark protocol
- Distributed sampled-data control of nonholonomic multi-robot systems with proximity networks
- A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment
- No Double Discount: Condition-Based Simultaneity Yields Limited Gain
- A new solution for the Byzantine agreement problem
- Programming simultaneous actions using common knowledge
- Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
- Robust gossiping with an application to consensus
- Practical quantum Byzantine protocol via nearly optimal entanglement resources
- Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
- Byzantine agreement with homonyms in synchronous systems
- Coordinated consensus in dynamic networks
- A distributed leader election algorithm in crash-recovery and omissive systems
- The Heard-Of model: computing in distributed systems with benign faults
- On the logical unsolvability of the Gettier problem
- Consensus when all processes may be Byzantine for some time
- Consensus in the presence of mortal Byzantine faulty processes
- Efficient parallel algorithms can be made robust
- Asynchronous Byzantine agreement with optimal resilience
- Models of closed multimachine computer systems with transient-fault-tolerance and fault-tolerance on the basis of replication under byzantine faults
- Scalable and secure computation among strangers: message-competitive Byzantine protocols
- The customizable fault/error model for dependable distributed systems.
- Resilient-optimal interactive consistency in constant time
- Computer science and decision theory
- No double discount: condition-based simultaneity yields limited gain
- Distributed graph coloring in a few rounds
- A flexible formal framework for masking/demasking faults
- Beyond Nash equilibrium: solution concepts for the 21st century
- Agreement in synchronous networks with ubiquitous faults
- Mutual information reconciliation in non-fully connected heterogeneous multicomputer computational systems
- A tight unconditional lower bound on distributed randomwalk computation
- A full proof of the BGW protocol for perfectly secure multiparty computation
- Revisiting the PAXOS algorithm
- Fault-tolerant spanners
- Consensus in Byzantine asynchronous systems
- Hundreds of impossibility results for distributed computing
- Using knowledge to optimally achieve coordination in distributed systems
- The complexity of reasoning about knowledge and time. I: Lower bounds
- Time-efficient randomized multiple-message broadcast in radio networks
- How to Solve Consensus in the Smallest Window of Synchrony
- Unconditional Byzantine agreement for any number of faulty processors (extended abstract)
- Byzantine agreement with homonyms
- Consensus algorithms with one-bit messages
- Error-free multi-valued consensus with Byzantine failures
- Clone wars: distributed detection of clone attacks in mobile WSNs
- An axiomatic approach to computing the connectivity of synchronous and asynchronous systems
- The round complexity of distributed sorting, extended abstract
- Probabilistic termination and composability of cryptographic protocols
- Optimal-time adaptive strong renaming, with applications to counting
- On the possibility and impossibility of achieving clock synchronization
- Implementing the Omega failure detector in the crash-recovery failure model
- Randomization can be a healer: consensus with dynamic omission failures
- Easy impossibility proofs for distributed consensus problems
- Toward more localized local algorithms, removing assumptions concerning global knowledge
- Common knowledge and consistent simultaneous coordination
- Fault-tolerant algorithms for tick-generation in asynchronous logic: robust pulse generation
- The computability of relaxed data structures: queues and stacks as examples
- A self-adjusting algorithm for Byzantine agreement
- Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip
- Locally checkable proofs
- Communication-efficient failure detection and consensus in omission environments
- Computing in totally anonymous asynchronous shared memory systems
- A complexity separation between the cache-coherent and distributed shared memory models
- Gossiping for communication-efficient broadcast
- P systems and the Byzantine agreement
- Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
- The robustness of stability under link and node failures
- Knowledge and common knowledge in a Byzantine environment: Crash failures
- Time is not a healer (preliminary version)
- Agreement under faulty interfaces
- Authenticated broadcast with a partially compromised public-key infrastructure
- Gathering despite mischief
- Secure message transmission in asynchronous networks
- Wait-free implementations in message-passing systems
- On the impact of link faults on Byzantine agreement
- A simple characterization of asynchronous computations
- The complexity of almost-optimal simultaneous coordination
- Randomized protocols for asynchronous consensus
- Verifiable secret sharing in a total of three rounds
- Minimum congestion mapping in a cloud
- A lower bound for the time to assure interactive consistency
- Efficient algorithms for anonymous Byzantine agreement
- A computer scientist looks at game theory.
- Renaming in synchronous message passing systems with Byzantine failures
- Rapid almost-complete broadcasting in faulty networks
- A theorem prover for a computational logic
- Serializability theory for replicated databases
- How to cope with faulty processors in a completely connected network of communicating processors
- The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols
- Continuous Consensus with Failures and Recoveries
- Extracting complexes that ensure sufficient structural conditions for system mutual informational agreement in multicomplex systems
- Message-optimal protocols for Byzantine Agreement
- Modular construction of an efficient 1-bit Byzantine agreement protocol
- Invited talk: Resilient distributed algorithms
- Efficient agreement using fault diagnosis.
- On expected constant-round protocols for Byzantine agreement
- On the round complexity of Byzantine agreement without initial set-up
- Continuous consensus with ambiguous failures
- Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures
- A simple proof of a simple consensus algorithm
This page was built for publication: Reaching Agreement in the Presence of Faults
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3873545)
