Pages that link to "Item:Q2787665"
From MaRDI portal
The following pages link to Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (Q2787665):
Displayed 23 items.
- Restoration by path concatenation (Q2787666) (← links)
- String realizers of posets with applications to distributed computing (Q2787668) (← links)
- On the generalized dining philosophers problem (Q2787669) (← links)
- An improved lower bound for the time complexity of mutual exclusion (Q2787670) (← links)
- Nearly optimal perfectly-periodic schedules (Q2787671) (← links)
- The do-all problem in broadcast networks (Q2787672) (← links)
- Competitive concurrent distributed queuing (Q2787673) (← links)
- Bandwidth constrained placement in a WAN (Q2787675) (← links)
- Compressed bloom filters (Q2787676) (← links)
- A hierarchy of conditions for consensus solvability (Q2787677) (← links)
- The concurrency hierarchy, and algorithms for unbounded concurrency (Q2787678) (← links)
- On scalable and efficient distributed failure detectors (Q2787680) (← links)
- Replicated condition monitoring (Q2787682) (← links)
- Computing property-preserving behaviour abstractions from trace reductions (Q2787684) (← links)
- Reliability and performance of hierarchical RAID with multiple controllers (Q2787688) (← links)
- Distributed multi-broadcast in unknown radio networks (Q2787689) (← links)
- Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks (Q2787691) (← links)
- Practical multi-candidate election system (Q2787692) (← links)
- An optimally robust hybrid mix network (Q2787693) (← links)
- Selective private function evaluation with applications to private statistics (Q2787694) (← links)
- Computing almost shortest paths (Q5890493) (← links)
- Distributed MST for constant diameter graphs (Q5890494) (← links)
- Average probe complexity in quorum systems (Q5890495) (← links)