← Foundations
Computer Science › Foundations ›

Algorithms

1295 directly classified papers

Papers per year

Papers

GOT: Testing for Originality in Natural Language Generation IJCNLP 2021
OPRA: An Open-Source Online Preference Reporting and Aggregation System AAAI 2021
Improving Continuous-time Conflict Based Search AAAI 2021
Consensus Maximisation Using Influences of Monotone Boolean Functions CVPR 2021
Inexact Loops in Robotics Problems RSS 2021
Qualitative Spatial and Temporal Reasoning: Current Status and Future Challenges IJCAI 2021
Rejection Sampling for Weighted Jaccard Similarity Revisited AAAI 2021
MultiLink: Multi-Class Structure Recovery via Agglomerative Clustering and Model Selection CVPR 2021
Efficient Sampling of Dependency Structure EMNLP 2021
Path Planning using Neural A* Search ICML 2021
Online Selection Problems against Constrained Adversary ICML 2021
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity ICML 2021
Winner Determination and Strategic Control in Conditional Approval Voting IJCAI 2021
An Automated Engineering Assistant: Learning Parsers for Technical Drawings AAAI 2021
Guaranteeing Maximin Shares: Some Agents Left Behind IJCAI 2021
Matchings with Group Fairness Constraints: Online and Offline Algorithms IJCAI 2021
Finding Consensus Bugs in Ethereum via Multi-transaction Differential Fuzzing OSDI 2021
A Faster Maximum Cardinality Matching Algorithm with Applications in Machine Learning NIPS 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
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
A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs NIPS 2021
Optimal Sketching for Trace Estimation NIPS 2021