The Movement Complexity of Sorting
cs.DS, cs.CC
Submitted: 2026-10-31
Updated: 2026-10-31
Terminology
Sources
- Sorting Under 1-$\infty$ Cost Model
- Lower Bounds for External Memory Integer Sorting via Network Coding
- Scattering and Sparse Partitions, and their Applications
- Stochastic and Worst-Case Generalized Sorting Revisited
- Lower bounds for the universal TSP on the plane
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