The following pages link to (Q5743466):
Displaying 18 items.
- A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots (Q259059) (← links)
- A note on hardness of diameter approximation (Q1705693) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- Redundancy in distributed proofs (Q2025853) (← links)
- Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
- Message lower bounds via efficient network synchronization (Q2292919) (← links)
- Distributed distance computation and routing with small messages (Q2422769) (← links)
- Low-congestion shortcuts without embedding (Q2657278) (← links)
- A distributed algorithm for directed minimum-weight spanning tree (Q2689838) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time (Q5020729) (← links)
- (Q5090444) (← links)
- (Q5090500) (← links)
- (Q5090916) (← links)
- (Q5091199) (← links)
- Distributed Testing of Distance-k Colorings (Q5100965) (← links)
- Distributed Graph Algorithms and their Complexity: An Introduction (Q5135263) (← links)
- Distributed construction of purely additive spanners (Q5915631) (← links)
