← Foundations
Computer Science › Foundations ›

Algorithms

1295 directly classified papers

Papers per year

Papers

Interference-free Walks in Time: Temporally Disjoint Paths IJCAI 2021
Computing Optimal Hypertree Decompositions with SAT IJCAI 2021
An Automated Engineering Assistant: Learning Parsers for Technical Drawings AAAI 2021
GOT: Testing for Originality in Natural Language Generation ACL 2021
Consensus Maximisation Using Influences of Monotone Boolean Functions CVPR 2021
Lifelong Multi-Agent Path Finding in Large-Scale Warehouses AAAI 2021
Persuading Voters in District-based Elections AAAI 2021
Finite Time LTI System Identification JMLR 2021
Winner Determination and Strategic Control in Conditional Approval Voting IJCAI 2021
Matchings with Group Fairness Constraints: Online and Offline Algorithms IJCAI 2021
Present-Biased Optimization AAAI 2021
Keyword Extraction Using Unsupervised Learning on the Document’s Adjacency Matrix NAACL 2021
Hierarchical Clustering via Sketches and Hierarchical Correlation Clustering AISTATS 2021
In-Database Regression in Input Sparsity Time ICML 2021
DEEPSPLIT: An Efficient Splitting Method for Neural Network Verification via Indirect Effect Analysis IJCAI 2021
Dimensionality Reduction for the Sum-of-Distances Metric ICML 2021
Putting the “Learning" into Learning-Augmented Algorithms for Frequency Estimation ICML 2021
Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time ICML 2021
Sequential Random Sampling Revisited: Hidden Shuffle Method AISTATS 2021
Multidimensional Scaling: Approximation and Complexity ICML 2021
Householder Sketch for Accurate and Accelerated Least-Mean-Squares Solvers ICML 2021
Unitary Branching Programs: Learnability and Lower Bounds ICML 2021
The Match-Extend serialization algorithm in Multiprecedence IJCNLP 2021
GOT: Testing for Originality in Natural Language Generation IJCNLP 2021
Qualitative Spatial and Temporal Reasoning: Current Status and Future Challenges IJCAI 2021