Pages that link to "Item:Q5145170"
From MaRDI portal
The following pages link to Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Q5145170):
Displaying 7 items.
- Deterministic Distributed Dominating Set Approximation in the CONGEST Model (Q5145186) (← links)
- Optimal Distributed Covering Algorithms (Q5145187) (← links)
- Towards a Theory of Randomized Shared Memory Algorithms (Q5145195) (← links)
- Can Distributed Uniformity Testing Be Local? (Q5145212) (← links)
- Hardness of Distributed Optimization (Q5145214) (← links)
- An Automatic Speedup Theorem for Distributed Problems (Q5145238) (← links)
- A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma (Q5145239) (← links)
