Algorithms
1,701 papers
Papers per year
1
1
1
11
4
8
14
8
21
27
50
43
38
32
65
94
127
163
161
169
168
221
200
74
'5
'10
'15
'20
'25
Papers
SySCD: A System-Aware Parallel Coordinate Descent Algorithm
NeurIPS 2019
Teaching Multiple Concepts to a Forgetful Learner
NeurIPS 2019
The Parameterized Complexity of Cascading Portfolio Scheduling
NeurIPS 2019
Total Least Squares Regression in Input Sparsity Time
NeurIPS 2019
Towards a Zero-One Law for Column Subset Selection
NeurIPS 2019
Towards Near-imperceptible Steganographic Text
ACL 2019
Turkish Treebanking: Unifying and Constructing Efforts
ACL 2019
Very Hard Electoral Control Problems
AAAI 2019
Adversarial Task Assignment
IJCAI 2018
A Fast Algorithm for Generalized Arc Consistency of the Alldifferent Constraint
IJCAI 2018
A Fast Algorithm for Optimally Finding Partially Disjoint Shortest Paths
IJCAI 2018
A Fast Local Search Algorithm for Minimum Weight Dominating Set Problem on Massive Graphs
IJCAI 2018
A GPU-based WFST Decoder with Exact Lattice Generation
Interspeech 2018
Analyzing Tie-Breaking Strategies for the A* Algorithm
IJCAI 2018
An Efficient Algorithm To Compute Distance Between Lexicographic Preference Trees
IJCAI 2018
An Exact Algorithm for Maximum k-Plexes in Massive Graphs
IJCAI 2018
An Optimization Framework for Recovery of Speech from Phase-Encoded Spectrograms
Interspeech 2018
Approximate Nearest Neighbors in Limited Space
COLT 2018
A Reactive Strategy for High-Level Consistency During Search
IJCAI 2018
ASAP: Fast, Approximate Graph Pattern Mining at Scale
OSDI 2018
A Theory-Based Evaluation of Nearest Neighbor Models Put Into Practice
NeurIPS 2018
Best-Case and Worst-Case Behavior of Greedy Best-First Search
IJCAI 2018
Beyond Grobner Bases: Basis Selection for Minimal Solvers
CVPR 2018
Coded Sparse Matrix Multiplication
ICML 2018
Complexity of Scheduling Charging in the Smart Grid
IJCAI 2018