Pages that link to "Item:Q2942729"

The following pages link to Polylog randomized wait-free consensus (Q2942729):

Displaying 13 items.

• Tight bounds for adopt-commit objects (Q487260) (← links)
• Switched PIOA: parallel composition via distributed scheduling (Q854167) (← links)
• Efficient execution of nondeterministic parallel programs on asynchronous systems (Q1383149) (← links)
• Task-structured probabilistic I/O automata (Q1745718) (← 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)
• Relationships between broadcast and shared memory in reliable anonymous distributed systems (Q1953650) (← links)
• Anonymous and fault-tolerant shared-memory computing (Q1954238) (← links)
• Randomized consensus with regular registers (Q2059870) (← links)
• Communication-efficient randomized consensus (Q2075627) (← links)
• Fault-Tolerant Consensus with an Abstract MAC Layer. (Q5090931) (← links)
• Randomized protocols for asynchronous consensus (Q5138489) (← links)