Data Structures & Algorithms

Papers

• Learning-Augmented Online Minimization with Dual Predictions (2026)
  Christian Coester et al.
  5.01
• Fair Online Resource Allocation (2026)
  Christopher En et al.
  5.01
• Incremental Sheaf Cohomology on Cellular Complexes: O(1)-in-n Lazy Edit Processing under Bounded Local Geometry (2026)
  Jason L. Volk
  4.39
• Sum-of-Squares Degree Barriers for the Reweighted-Hinge Method in Robust Halfspace Learning: A Christoffel-Function Characterization (2026)
  Xiaoyu Li
  4.39
• FOSC-X: An Extended Framework for Optimal Local Cuts and Non-Horizontal Cluster Selection from Clustering Hierarchies (2026)
  Connor Simpson et al.
  4.39
• Fixed-Parameter Tractability of Private Synthetic Data Generation (2026)
  Badih Ghazi et al.
  3.51
• The Complexity of Min-Max Optimization for Quadratic Polynomials (2026)
  Martino Bernasconi et al.
  3.51
• Lower Complexity Bounds for Nonconvex-Strongly-Convex Bilevel Optimization with First-Order Oracles (2025)
  Kaiyi Ji
  2.68
• Beyond Averaging in John Ellipsoid Approximation: High-Accuracy Algorithms in the Leverage-Score Model (2026)
  Xiaoyu Li et al.
  2.00
• Characterizing Admissible Objective Functions for Hierarchical Clustering (2026)
  Ryuki Tsukuba et al.
  1.89
• Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem (2025)
  Hue T. Nguyen et al.
  1.61
• The Hidden Cost of Approximation in Online Mirror Descent (2025)
  Ofir Schlisselberg et al.
  1.61
• Phase Transition for Stochastic Block Model with more than $\sqrt{n}$ Communities (2025)
  Alexandra Carpentier et al.
  1.50
• An adaptive prefix-assignment technique for symmetry reduction (2017)
  Tommi Junttila (1) et al.
  —
• Representing Piecewise-Linear Functions by Functions with Minimal Arity (2024)
  Christoph Koutschan et al.
  —