Pages that link to "Item:Q1660917"
From MaRDI portal
The following pages link to Near-linear lower bounds for distributed distance computations, even in sparse networks (Q1660917):
Displaying 14 items.
- A note on hardness of diameter approximation (Q1705693) (← links)
- Redundancy in distributed proofs (Q2025853) (← links)
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- The sparsest additive spanner via multiple weighted BFS trees (Q2201997) (← links)
- Low-congestion shortcut and graph parameters (Q2241301) (← links)
- Message lower bounds via efficient network synchronization (Q2292919) (← links)
- Distributed distance computation and routing with small messages (Q2422769) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time (Q5020729) (← links)
- (Q5090916) (← links)
- The Sparsest Additive Spanner via Multiple Weighted BFS Trees (Q5091078) (← links)
- Distributed Testing of Distance-k Colorings (Q5100965) (← links)
- Approximate proof-labeling schemes (Q5919426) (← links)
- Communication costs in a geometric communication network (Q6052702) (← links)
