All Stories

  1. Polylog-Competitive Deterministic Local Routing and Scheduling
  2. Sparse Semi-Oblivious Routing: Few Random Paths Suffice
  3. Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances
  4. Universally-Optimal Distributed Exact Min-Cut
  5. Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver
  6. Tree embeddings for hop-constrained network design
  7. Hop-constrained oblivious routing
  8. Universally-optimal distributed algorithms for known topologies