Pages that link to "Item:Q5361369"
From MaRDI portal
The following pages link to Proceedings of the twelfth annual ACM symposium on Principles of distributed computing - PODC '93 (Q5361369):
Displayed 21 items.
- Wait-free clock synchronization (Q5361370) (← links)
- Optimal clock synchronization under different delay assumptions (Q5361371) (← links)
- Designing algorithms for distributed systems with partially synchronized clocks (Q5361372) (← links)
- Resource bounds and combinations of consensus objects (Q5361373) (← links)
- On the robustness of Herlihy's hierarchy (Q5361374) (← links)
- A completeness theorem for a class of synchronization objects (Q5361376) (← links)
- Fast, scalable synchronization with minimal hardware support (Q5361377) (← links)
- Adaptive solutions to the mutual exclusion problem (Q5361378) (← links)
- Unifying self-stabilization and fault-tolerance (Q5361379) (← links)
- Distributed fingerprints and secure information dispersal (Q5361380) (← links)
- Efficient detection of corrupted pages in a replicated file (Q5361381) (← links)
- Implementing hybrid consistency with high-level synchronization operations (Q5361382) (← links)
- On the space complexity of randomized synchronization (Q5361383) (← links)
- A lower bound on wait-free counting (Q5361384) (← links)
- Knowledge-oriented programming (Q5361386) (← links)
- A perspective on AN2 (Q5365155) (← links)
- Atomic snapshots in <i>O(n</i> log <i>n)</i> operations (Q5365156) (← links)
- Immediate atomic snapshots and fast renaming (Q5365157) (← links)
- Bounded round number (Q5365158) (← links)
- An Ω(<i>D</i> log(<i>N/D</i>)) lower bound for broadcast in radio networks (Q5365159) (← links)
- Fast deflection routing for packets and worms (Q5365160) (← links)
