← Foundations
Computer Science › Foundations ›

Algorithms

1295 directly classified papers

Papers per year

Papers

On Total-Order HTN Plan Verification with Method Preconditions – An Extension of the CYK Parsing Algorithm AAAI 2023
Fair Division of a Graph into Compact Bundles IJCAI 2023
Three Iterations of (d − 1)-WL Test Distinguish Non Isometric Clouds of d-dimensional Points NIPS 2023
Fantastic Weights and How to Find Them: Where to Prune in Dynamic Sparse Training NIPS 2023
Coneheads: Hierarchy Aware Attention NIPS 2023
Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time ICML 2023
Solving Explainability Queries with Quantification: The Case of Feature Relevancy AAAI 2023
Harnessing the power of choices in decision tree learning NIPS 2023
ClusterFuG: Clustering Fully connected Graphs by Multicut ICML 2023
Bicriteria Approximation Algorithms for the Submodular Cover Problem NIPS 2023
Parallel Submodular Function Minimization NIPS 2023
Learning to Configure Separators in Branch-and-Cut NIPS 2023
LambdaBeam: Neural Program Search with Higher-Order Functions and Lambdas NIPS 2023
Differentially Private Approximate Near Neighbor Counting in High Dimensions NIPS 2023
A One-Size-Fits-All Approach to Improving Randomness in Paper Assignment NIPS 2023
Improved Frequency Estimation Algorithms with and without Predictions NIPS 2023
Quantum Multi-Model Fitting CVPR 2023
On the Expressive Power of Geometric Graph Neural Networks ICML 2023
Finding Good Partial Assignments during Restart-Based Branch and Bound Search AAAI 2023
Optimal Pathfinding on Weighted Grid Maps AAAI 2023
A New Variable Ordering for In-processing Bounded Variable Elimination in SAT Solvers IJCAI 2023
$k$-Means Clustering with Distance-Based Privacy NIPS 2023
Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth? AAAI 2023
Co-Certificate Learning with SAT Modulo Symmetries IJCAI 2023
Unlimiformer: Long-Range Transformers with Unlimited Length Input NIPS 2023