Pages that link to "Item:Q3766834"

The following pages link to Bounds on information exchange for Byzantine agreement (Q3766834):

Displaying 14 items.

• A simple characterization of asynchronous computations (Q477089) (← links)
• Robust gossiping with an application to consensus (Q856404) (← links)
• Gossiping by processors prone to omission failures (Q976104) (← links)
• Modular construction of a Byzantine agreement protocol with optimal message bit complexity (Q1186809) (← links)
• On the message complexity of binary Byzantine agreement under crash failures (Q1189856) (← links)
• A self-adjusting algorithm for Byzantine agreement (Q1189860) (← links)
• Consensus under unreliable transmission (Q1285678) (← links)
• Efficient agreement using fault diagnosis. (Q1312601) (← links)
• Fast consensus in networks of bounded degree. (Q1312604) (← links)
• Information-theoretic broadcast with dishonest majority for long messages (Q1629421) (← links)
• Optimal time byzantine agreement for t <n/8 with linear-messages (Q5137009) (← links)
• Hundreds of impossibility results for distributed computing (Q5138488) (← links)
• Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
• Reaching consensus for asynchronous distributed key generation (Q6096032) (← links)