Pages that link to "Item:Q2796236"
From MaRDI portal
The following pages link to Near-Optimal Scheduling of Distributed Algorithms (Q2796236):
Displaying 8 items.
- On efficient distributed construction of near optimal routing schemes (Q1741966) (← links)
- Near-optimal scheduling in the congested clique (Q2117708) (← links)
- Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q2146871) (← links)
- Low-congestion shortcut and graph parameters (Q2241301) (← links)
- Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time (Q5020729) (← links)
- Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts (Q6071121) (← links)
- Distributed constructions of dual-failure fault-tolerant distance preservers (Q6535019) (← links)
- Near-optimal distributed computation of small vertex cuts (Q6579850) (← links)
