Pages that link to "Item:Q5090921"
From MaRDI portal
The following pages link to Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set (Q5090921):
Displaying 7 items.
- Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q2146871) (← links)
- The sparsest additive spanner via multiple weighted BFS trees (Q2201997) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- The Sparsest Additive Spanner via Multiple Weighted BFS Trees (Q5091078) (← links)
- Network Decomposition and Distributed Derandomization (Invited Paper) (Q5100942) (← links)
- Deterministic Massively Parallel Connectivity (Q6069413) (← links)
- Faster deterministic distributed MIS and approximate matching (Q6499340) (← links)
