Expander Routing under Adversarial Deletions via Temporal Aggregation
cs.DS
Submitted: 2026-11-02
Updated: 2026-11-02
Terminology
Sources
- New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms
- Maintaining Random Assignments under Adversarial Dynamics
- Distributed Data Summarization in Well-Connected Networks
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time