Pages that link to "Item:Q1604211"
From MaRDI portal
The following pages link to Perfect information leader election in \(\log^*n+O(1)\) rounds (Q1604211):
Displayed 11 items.
- An optimally fair coin toss (Q315542) (← links)
- Stochastic coalescence in logarithmic time (Q1948695) (← links)
- Game-theoretic fairness meets multi-party protocols: the case of leader election (Q2128554) (← links)
- Explicit two-source extractors and resilient functions (Q2320598) (← links)
- Lower bound for scalable Byzantine agreement (Q2377258) (← links)
- Extractors from Reed-Muller codes (Q2496317) (← links)
- High entropy random selection protocols (Q2659776) (← links)
- Rationality in the Full-Information Model (Q3408207) (← links)
- (Q5091215) (← links)
- (Q5743419) (← links)
- \(\log^\ast\)-round game-theoretically-fair leader election (Q6108988) (← links)