Pages that link to "Item:Q2819564"
From MaRDI portal
The following pages link to Lower bounds for leader election and collective coin-flipping in the perfect information model (Q2819564):
Displaying 5 items.
- A lower bound for adaptively-secure collective coin flipping protocols (Q822636) (← links)
- Perfect information leader election in \(\log^*n+O(1)\) rounds (Q1604211) (← links)
- Game-theoretic fairness meets multi-party protocols: the case of leader election (Q2128554) (← links)
- Randomization helps to perform independent tasks reliably (Q4446875) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)