The following pages link to (Q3666268):
Displaying 22 items.
- On the impact of link faults on Byzantine agreement (Q476176) (← links)
- Randomization can be a healer: consensus with dynamic omission failures (Q661060) (← links)
- The minimum information about failures for solving non-local tasks in message-passing systems (Q661069) (← links)
- On the complexity of computation in the presence of link failures: The case of a ring (Q808251) (← links)
- Knowledge and common knowledge in a Byzantine environment: Crash failures (Q918186) (← links)
- Stopping times of distributed consensus protocols: a probabilistic analysis (Q1089784) (← links)
- Reliable broadcasts and communication models: tradeoffs and lower bounds (Q1112599) (← links)
- On the message complexity of binary Byzantine agreement under crash failures (Q1189856) (← links)
- Space-efficient asynchronous consensus without shared memory initialization (Q1209330) (← links)
- Using knowledge to optimally achieve coordination in distributed systems (Q1292424) (← links)
- Distributed consensus revisited (Q1318741) (← links)
- Revisiting the PAXOS algorithm (Q1575634) (← links)
- Robust learning in social networks via matrix scaling (Q2060364) (← links)
- The epigenetic consensus problem (Q2117720) (← links)
- Algorand: a secure and efficient distributed ledger (Q2422025) (← links)
- A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment (Q4031320) (← links)
- Message-optimal protocols for Byzantine Agreement (Q4031321) (← links)
- The Failure Discovery problem (Q4031322) (← links)
- (Q5028433) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Multidimensional Byzantine agreement in a synchronous setting (Q6122408) (← links)
- Building blocks of sharding blockchain systems: concepts, approaches, and open problems (Q6158770) (← links)
