Foundations

Low-Degree Method Fails to Predict Robust Subspace Recovery COLT 2026 MDK: Rethinking the Data Center Memory Reclamation Problem OSDI 2026 MEGALON: Efficient Data Sharing for Partly Coherent CXL Memory OSDI 2026 Merlin: An Efficient Adaptive Cache Eviction Algorithm via Fine-Grained Characterization OSDI 2026 Multiwinner Voting with Interval Preferences under Incomplete Information UAI 2026 Online and Offline Learning of Orderly Hypergraphs Using Queries ALT 2026 Online Caching in Tree Networks: Algorithms, Regret, and Complexity L4DC 2026 Online Fair Allocation with Demand-Side Time-Dependent Weight UAI 2026 On the Hardness of Learning Regular Expressions ALT 2026 On the Statistical Query Complexity of Learning Semiautomata: a Random Walk Approach COLT 2026 Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs COLT 2026 Optimal Software Pipelining and Warp Specialization for Tensor Core GPUs OSDI 2026 Parallel Rigidity Matters for Bundle Adjustment CVPR 2026 Perfect Matching Map Recovery Under Unknown Scalar Affine Transformation UAI 2026 Phase Transition for Stochastic Block Model with more than $\sqrtn$ Communities COLT 2026 Phase Transition in Convex Relaxations for Graph Alignment COLT 2026 PlanB: Efficient Software IPv6 Lookup with Linearized B+-Tree NSDI 2026 Pluto: High-Performance, Memory-Efficient Distributed Graph Analytics through Advanced Mirroring OSDI 2026 Polynomial-time sampling despite disorder chaos COLT 2026 Prefix Parsing is Just Parsing ACL 2026 Query Efficient Structured Matrix Learning COLT 2026 Quiet Planting for k-SAT, Multiple Solutions of Arbitrary Geometry COLT 2026 Reconstructing Riemannian Metrics From Random Geometric Graphs COLT 2026 Recovery of Planted Subgraphs COLT 2026 Robust Algorithms for Finding Cliques in Random Intersection Graphs via Sum-of-Squares COLT 2026