Pages that link to "Item:Q4714556"

The following pages link to Randomized Consensus in Expected $O(N\log ^2 N)$ Operations Per Processor (Q4714556):

Displaying 10 items.

• Combining shared-coin algorithms (Q666060) (← links)
• A modular approach to shared-memory consensus, with applications to the probabilistic-write model (Q1938364) (← links)
• Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler (Q1953239) (← links)
• On the importance of having an identity or, is consensus really universal? (Q1953645) (← links)
• Communication-efficient randomized consensus (Q2075627) (← links)
• Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers (Q3095338) (← links)
• A Tight Space Bound for Consensus (Q4997312) (← links)
• Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study (Q5137903) (← links)
• Hundreds of impossibility results for distributed computing (Q5138488) (← links)
• Randomized protocols for asynchronous consensus (Q5138489) (← links)