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
Quantified Linear and Polynomial Arithmetic Satisfiability via Template-based Skolemization
AAAI 2025
Quantum (Inspired) D^2-sampling with Applications
ICLR 2025
Quantum Speedup for Hypergraph Sparsification
ICML 2025
Quantum Speedups for Bayesian Network Structure Learning
UAI 2025
Reassessing Graph Linearization for Sequence-to-sequence AMR Parsing: On the Advantages and Limitations of Triple-Based
NAACL 2025
RePoseD: Efficient Relative Pose Estimation With Known Depth Information
ICCV 2025
Representation Preserving Multiclass Agnostic to Realizable Reduction
ICML 2025
Resource Constrained Pathfinding with Enhanced Bidirectional A* Search
AAAI 2025
Restructuring Tractable Probabilistic Circuits
AISTATS 2025
Revisiting Proportional Allocation with Subsidy: Simplification and Improvements
IJCAI 2025
Robust random graph matching in Gaussian models via vector approximate message passing
COLT 2025
Robust Sparsification via Sensitivity
ICML 2025
Root Cause Analysis of Failures from Partial Causal Structures
UAI 2025
SAMBLE: Shape-Specific Point Cloud Sampling for an Optimal Trade-Off Between Local Detail and Global Uniformity
CVPR 2025
Scalable Approximation Algorithms for p-Wasserstein Distance and Its Variants
ICML 2025
Scenario-Based Robust Optimization of Tree Structures
AAAI 2025
Schwarz–Schur Involution: Lightspeed Differentiable Sparse Linear Solvers
ICML 2025
Settling the Maximin Share Fairness for Scheduling among Groups of Machines
ICML 2025
Single-Scanline Relative Pose Estimation for Rolling Shutter Cameras
ICCV 2025
Solving Higher-Order Quantified Boolean Satisfiability via Higher-Order Model Checking
AAAI 2025
Solving Multiagent Path Finding on Highly Centralized Networks
AAAI 2025
Solving QNP and FOND+ with Generating, Testing and Forbidding
IJCAI 2025
Solving Satisfiability Modulo Counting Exactly with Probabilistic Circuits
ICML 2025
Sort Before You Prune: Improved Worst-Case Guarantees of the DiskANN Family of Graphs
ICML 2025
Sound Over-Approximation of Equational Reasoning with Variable-Preserving Rules Parameterized by Derivation Depth
AAAI 2025