Pages that link to "Item:Q3177770"
From MaRDI portal
The following pages link to Byzantine Agreement in Expected Polynomial Time (Q3177770):
Displaying 11 items.
- Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems (Q1686116) (← links)
- Expected constant round Byzantine broadcast under dishonest majority (Q2055728) (← links)
- On the round complexity of randomized Byzantine agreement (Q2121502) (← links)
- Byzantine preferential voting (Q2190409) (← links)
- Quantum Byzantine agreement with tripartite entangled states (Q2323766) (← links)
- Algorand: a secure and efficient distributed ledger (Q2422025) (← links)
- A characterization of eventual Byzantine agreement (Q2784483) (← links)
- From Almost Everywhere to Everywhere: Byzantine Agreement with $\tilde{O}(n^{3/2})$ Bits (Q3646244) (← links)
- Fully Polynomial Byzantine Agreement for <i>n</i> > 3<i>t</i> Processors in <i>t</i> + 1 Rounds (Q4388871) (← links)
- Byzantine agreement in polynomial expected time (Q5495810) (← links)
- On the round complexity of randomized Byzantine agreement (Q6487529) (← links)
