Foundations
2,177 papers (1 classified directly here)
Subtopics · a paper can sit in several, so these overlap
Papers per year
1
1
1
13
7
16
17
14
29
34
65
54
49
45
81
116
167
207
197
202
208
285
271
97
'5
'10
'15
'20
'25
Papers (including subtopics)
RT: Regular Types for the Streaming Shell
OSDI 2026
SketchPipe: Toward Accurate Sketch-based Network Measurement on Multi-Pipeline Switches with Splitless Sketch Placement
NSDI 2026
Solvability of the Viewing Graph Under the Affine Camera Model
CVPR 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
Syncopate: Efficient Multi-GPU AI Kernels via Automatic Chunk-Centric Compute-Communication Overlap
OSDI 2026
Testing for a Hidden Geometry in Random Graphs
COLT 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
Topological Dynamics via Learned Hybrid Systems
L4DC 2026
Two-way Node Popularity Model for Directed and Bipartite Networks
JMLR 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
3D Edge Sketch from Multiview Images
WACV 2025
Accurate Link Prediction for Edge-Incomplete Graphs via PU Learning
AAAI 2025