Algorithms
1,701 papers
Papers per year
1
1
1
11
4
8
14
8
21
27
50
43
38
32
65
94
127
163
161
169
168
221
200
74
'5
'10
'15
'20
'25
Papers
Perfect Matching Map Recovery Under Unknown Scalar Affine Transformation
UAI 2026
PlanB: Efficient Software IPv6 Lookup with Linearized B+-Tree
NSDI 2026
Polynomial-time sampling despite disorder chaos
COLT 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
SketchPipe: Toward Accurate Sketch-based Network Measurement on Multi-Pipeline Switches with Splitless Sketch Placement
NSDI 2026
Solving Minimal Problems Without Matrix Inversion Using FFT-Based Interpolation
CVPR 2026
Space-Efficient Language Generation in the Limit
COLT 2026
Spain: Succinct Proofs for Numerical Computations
OSDI 2026
Spectral Recovery of a Planted Triangle-Dense Subgraph
COLT 2026
Spectral Valleys and Sharp Failures in Greedy Determinant Maximization
COLT 2026
Strongly Polynomial Time Complexity of Policy Iteration for $L_∞$ Robust MDPs
COLT 2026
Supercharging Packet-level Network Simulation of Large Model Training via Memoization and Fast-Forwarding
NSDI 2026
The Art of Calling the Winner by Asking Just Enough Questions
UAI 2026
The Limitations and Power of NP-Oracle Based Functional Synthesis Techniques
AAAI 2026
The matrix-vector complexity of Ax=b
COLT 2026
Themis: Scheduling-Aware Buffer Management for HBM-Based Hybrid Buffers
NSDI 2026
Universal Safety Controllers with Learned Prophecies
AAAI 2026
Wedge Sampling: Efficient Tensor Completion with Nearly-Linear Sample Complexity
COLT 2026
When Can We Learn from Noisy Logical Data? Parameterized Complexity of Approximate Concept Fitting in Description Logics
UAI 2026
WiseCode: Breaking the Scalability Barriers of Wide-Stripe Vector Codes
OSDI 2026
(1+1) Genetic Programming with Functionally Complete Instruction Sets Can Evolve Boolean Conjunctions and Disjunctions with Arbitrarily Small Error
AAAI 2025