Pages that link to "Item:Q5170859"
From MaRDI portal
The following pages link to Proceedings of the twenty-first annual symposium on Principles of distributed computing (Q5170859):
Displayed 28 items.
- Nonatomic mutual exclusion with local spinning (Q5170860) (← links)
- Space-optimal multi-writer snapshot objects are slow (Q5170861) (← links)
- Safe memory reclamation for dynamic lock-free objects using atomic reads and writes (Q5170862) (← links)
- Non-blocking timeout in scalable queue-based spin locks (Q5170863) (← links)
- Establishing wireless conference calls under delay constraints (Q5170864) (← links)
- Efficient algorithms for leader election in radio networks (Q5170865) (← links)
- GS <sup>3</sup> (Q5170866) (← links)
- Lexicographically optimal smoothing for broadband traffic multiplexing (Q5170868) (← links)
- <b>Active disk paxos</b> with infinitely many processes (Q5170869) (← links)
- The inherent price of indulgence (Q5170870) (← links)
- Minimal replication cost for availability (Q5170871) (← links)
- Building secure file systems out of byzantine storage (Q5170872) (← links)
- Detectable byzantine agreement secure against faulty majorities (Q5170873) (← links)
- Nearly optimal FIFO buffer management for DiffServ (Q5170874) (← links)
- Optimal plans for aggregation (Q5170875) (← links)
- Searching for a black hole in arbitrary networks (Q5170876) (← links)
- General perfectly periodic scheduling (Q5170877) (← links)
- A BGP-based mechanism for lowest-cost routing (Q5170878) (← links)
- Viceroy (Q5170879) (← links)
- On perfectly secure communication over arbitrary networks (Q5170880) (← links)
- Sequential composition of protocols without simultaneous termination (Q5170881) (← links)
- Fault-tolerant routing in peer-to-peer systems (Q5170882) (← links)
- Analysis of the evolution of peer-to-peer systems (Q5170883) (← links)
- Evaluating the running time of a communication round over the internet (Q5170885) (← links)
- Two-handed emulation (Q5170886) (← links)
- <i>f</i> -arrays (Q5170887) (← links)
- Non-blocking steal-half work queues (Q5170888) (← links)
- Dynamic and self-stabilizing distributed matching (Q5170890) (← links)