The following pages link to (Q5417681):
Displaying 14 items.
- Managed agreement: generalizing two fundamental distributed agreement problems (Q845930) (← links)
- Crash-tolerant consensus in directed graph revisited (extended abstract) (Q1713896) (← links)
- Communication-efficient randomized consensus (Q2075627) (← links)
- Global synchronization and consensus using beeps in a fault-prone multiple access channel (Q2285154) (← links)
- Leader election in well-connected graphs (Q2696279) (← links)
- The Cost of Fault Tolerance in Multi-Party Communication Complexity (Q3189654) (← links)
- The Time-Complexity of Local Decision in Distributed Agreement (Q3507518) (← links)
- (Q4934338) (← links)
- Tight bounds for communication-assisted agreement distillation (Q5368740) (← links)
- Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions (Q5964896) (← links)
- Phase transitions of Best‐of‐two and Best‐of‐three on stochastic block models (Q6074651) (← links)
- Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions (Q6483583) (← links)
- Quasi-majority functional voting on expander graphs (Q6641063) (← links)
- Sublinear message bounds of authenticated implicit Byzantine agreement (Q6646446) (← links)
