← Foundations
Computer Science › Foundations ›

Algorithms

1295 directly classified papers

Papers per year

Papers

Two-goal Local Search and Inference Rules for Minimum Dominating Set IJCAI 2020
A Game Theoretic Approach For Core Resilience IJCAI 2020
On Testing of Samplers NIPS 2020
Adaptive Probing Policies for Shortest Path Routing NIPS 2020
Mitigating Manipulation in Peer Review via Randomized Reviewer Assignments NIPS 2020
Hitting the High Notes: Subset Selection for Maximizing Expected Order Statistics NIPS 2020
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint NIPS 2020
Explaining Naive Bayes and Other Linear Classifiers with Polynomial Time and Delay NIPS 2020
Graph-based Nearest Neighbor Search: From Practice to Theory ICML 2020
Composable Sketches for Functions of Frequencies: Beyond the Worst Case ICML 2020
Optimization from Structured Samples for Coverage Functions ICML 2020
Sub-linear Memory Sketches for Near Neighbor Search on Streaming Data ICML 2020
Learning Invariants through Soft Unification NIPS 2020
Euclidean Pathfinding with Compressed Path Databases IJCAI 2020
Iterative-Deepening Conflict-Based Search IJCAI 2020
Delete- and Ordering-Relaxation Heuristics for HTN Planning IJCAI 2020
The Complexity Landscape of Resource-Constrained Scheduling IJCAI 2020
NuCDS: An Efficient Local Search Algorithm for Minimum Connected Dominating Set IJCAI 2020
FourierSAT: A Fourier Expansion-Based Algebraic Framework for Solving Hybrid Boolean Constraints AAAI 2020
Bidirectional Heuristic Search: Expanding Nodes by a Lower Bound IJCAI 2020
Cost Volume Pyramid Based Depth Inference for Multi-View Stereo CVPR 2020
Constructing Minimal Perfect Hash Functions Using SAT Technology AAAI 2020
Generating Interactive Worlds with Text AAAI 2020
The Impact of Selfishness in Hypergraph Hedonic Games AAAI 2020
Facility Location Problem with Capacity Constraints: Algorithmic and Mechanism Design Perspectives AAAI 2020