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
3D Edge Sketch from Multiview Images
WACV 2025
A Conic Transformation Approach for Solving the Perspective-Three-Point Problem
WACV 2025
A Fine-Grained Complexity View on Propositional Abduction - Algorithms and Lower Bounds
IJCAI 2025
Algorithms with Calibrated Machine Learning Predictions
ICML 2025
A Linear N-Point Solver for Structure and Motion from Asynchronous Tracks
ICCV 2025
Almost linear time differentially private release of synthetic graphs
AISTATS 2025
A Market for Accuracy: Classification Under Competition
ICML 2025
An And-Sum Circuit with Signed Edges That Is More Succinct than SDD
AAAI 2025
An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale
ICML 2025
A Near Linear Query Lower Bound for Submodular Maximization
ICML 2025
An Information-theoretic Perspective of Hierarchical Clustering on Graphs
UAI 2025
Application of Structured State Space Models to High energy physics with locality sensitive hashing
AISTATS 2025
Approximating the Total Variation Distance between Gaussians
AISTATS 2025
Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching
ACL 2025
A Subquadratic Time Approximation Algorithm for Individually Fair k-Center
AISTATS 2025
Attractor-based Closed List Search: Sparsifying the Closed List for Efficient Memory-Constrained Planning
IJCAI 2025
Automated Strategy Invention for Confluence of Term Rewrite Systems
IJCAI 2025
AxlePro: Momentum-Accelerated Batched Training of Kernel Machines
AISTATS 2025
Balanced and Fair Partitioning of Friends
AAAI 2025
Balancing Bias in Two-sided Markets for Fair Stable Matchings
ICLR 2025
Beyond Worst-Case Dimensionality Reduction for Sparse Vectors
ICLR 2025
Bimodal Depth-First Search for Scalable GAC for AllDifferent
IJCAI 2025
Breaking Barriers: Combinatorial Algorithms for Non-Monotone Submodular Maximization with Sublinear Adaptivity and $1/e$ Approximation
ICML 2025
Breaking Symmetries in Quantified Graph Search: A Comparative Study
AAAI 2025
Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries
ICML 2025