← Foundations
Computer Science › Foundations ›

Algorithms

1295 directly classified papers

Papers per year

Papers

Parallel Constraint Acquisition AAAI 2021
Satisfiability and Algorithms for Non-uniform Random k-SAT AAAI 2021
Extreme k-Center Clustering AAAI 2021
Proportional Representation under Single-Crossing Preferences Revisited AAAI 2021
Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable AAAI 2021
The Parameterized Complexity of Clustering Incomplete Data AAAI 2021
Revisiting Co-Occurring Directions: Sharper Analysis and Efficient Algorithm for Sparse Matrices AAAI 2021
Objective-Based Hierarchical Clustering of Deep Embedding Vectors AAAI 2021
Approximate Multiplication of Sparse Matrices with Limited Space AAAI 2021
On the Optimal Efficiency of A* with Dominance Pruning AAAI 2021
Generalization in Portfolio-Based Algorithm Selection AAAI 2021
Parameterized Algorithms for MILPs with Small Treedepth AAAI 2021
Single Player Monte-Carlo Tree Search Based on the Plackett-Luce Model AAAI 2021
Constraint-Driven Learning of Logic Programs AAAI 2021
Automatic Optimal Multi-Agent Path Finding Algorithm Selector (Student Abstract) AAAI 2021
FACS: Fast Code-based Algorithm for Coalition Structure Generation (Student Abstract) AAAI 2021
GOT: Testing for Originality in Natural Language Generation ACL 2021
Globally Optimal Relative Pose Estimation With Gravity Prior CVPR 2021
Crossing Cuts Polygonal Puzzles: Models and Solvers CVPR 2021
Consensus Maximisation Using Influences of Monotone Boolean Functions CVPR 2021
MultiLink: Multi-Class Structure Recovery via Agglomerative Clustering and Model Selection CVPR 2021
Efficient Sampling of Dependency Structure EMNLP 2021
Searching for More Efficient Dynamic Programs EMNLP 2021
SPANN: Highly-efficient Billion-scale Approximate Nearest Neighborhood Search NIPS 2021
Practical Near Neighbor Search via Group Testing NIPS 2021