Pages that link to "Item:Q3873545"
From MaRDI portal
The following pages link to Reaching Agreement in the Presence of Faults (Q3873545):
Displaying 50 items.
- Stopping times of distributed consensus protocols: a probabilistic analysis (Q1089784) (← links)
- Asynchronous byzantine agreement protocols (Q1091131) (← links)
- Programming simultaneous actions using common knowledge (Q1104074) (← links)
- The complexity of reasoning about knowledge and time. I: Lower bounds (Q1119565) (← links)
- A lower bound for the time to assure interactive consistency (Q1168726) (← links)
- Two distributed problems involving Byzantine processes (Q1186434) (← links)
- Modular construction of a Byzantine agreement protocol with optimal message bit complexity (Q1186809) (← links)
- Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement (Q1187030) (← links)
- On the message complexity of binary Byzantine agreement under crash failures (Q1189856) (← links)
- Efficient parallel algorithms can be made robust (Q1189859) (← links)
- A self-adjusting algorithm for Byzantine agreement (Q1189860) (← links)
- Machine checked proofs of the design of a fault-tolerant circuit (Q1203129) (← links)
- Low-cost clock synchronization (Q1261107) (← links)
- Consensus under unreliable transmission (Q1285678) (← links)
- Using knowledge to optimally achieve coordination in distributed systems (Q1292424) (← links)
- Reliable communication over partially authenticated networks (Q1292432) (← links)
- Wait-free implementations in message-passing systems (Q1292433) (← links)
- Efficient agreement using fault diagnosis. (Q1312601) (← links)
- Necessary and sufficient conditions for broadcast consensus protocols. (Q1312603) (← links)
- Fast consensus in networks of bounded degree. (Q1312604) (← links)
- A formal model of asynchronous communication and its use in mechanically verifying a biphase mark protocol (Q1318283) (← links)
- Stability of long-lived consensus. (Q1401978) (← links)
- A computer scientist looks at game theory. (Q1413213) (← links)
- Revisiting the PAXOS algorithm (Q1575634) (← links)
- Information-theoretic broadcast with dishonest majority for long messages (Q1629421) (← links)
- Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems (Q1686116) (← links)
- Fairness versus guaranteed output delivery in secure multiparty computation (Q1698398) (← links)
- A simple voting protocol on quantum blockchain (Q1740970) (← links)
- Characterization of secure multiparty computation without broadcast (Q1753172) (← links)
- On the logical unsolvability of the Gettier problem (Q1770635) (← links)
- Yet another compiler for active security or: efficient MPC over arbitrary rings (Q1784116) (← links)
- Toward an algebraic theory of systems (Q1786609) (← links)
- A simple proof of a simple consensus algorithm (Q1825626) (← links)
- A flexible formal framework for masking/demasking faults (Q1827146) (← links)
- Consensus in Byzantine asynchronous systems (Q1827288) (← links)
- The customizable fault/error model for dependable distributed systems. (Q1853630) (← links)
- Byzantine-resistant total ordering algorithms. (Q1854265) (← links)
- Computing in totally anonymous asynchronous shared memory systems (Q1854512) (← links)
- A modular approach to shared-memory consensus, with applications to the probabilistic-write model (Q1938364) (← links)
- Communication-efficient and crash-quiescent omega with unknown membership (Q1944072) (← links)
- Communication-efficient failure detection and consensus in omission environments (Q1944087) (← links)
- Renaming in synchronous message passing systems with Byzantine failures (Q1954260) (← links)
- The computational structure of progress conditions and shared objects (Q1988520) (← links)
- Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures (Q2009633) (← links)
- Reaching approximate Byzantine consensus with multi-hop communication (Q2013588) (← links)
- A simple Byzantine generals protocol (Q2015794) (← links)
- Fault tolerance in large games (Q2016249) (← links)
- Higher-order quantifier elimination, counter simulations and fault-tolerant systems (Q2031422) (← links)
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999) (← links)
- Communication-efficient randomized consensus (Q2075627) (← links)