Foundations

Representing Formal Languages: A Comparison Between Finite Automata and Recurrent Neural Networks ICLR 2019 Re-randomized Densification for One Permutation Hashing and Bin-wise Consistent Weighted Sampling NeurIPS 2019 Resolution and Domination: An Improved Exact MaxSAT Algorithm IJCAI 2019 Revisiting the Bethe-Hessian: Improved Community Detection in Sparse Heterogeneous Graphs NeurIPS 2019 Robustness of Spectral Methods for Community Detection COLT 2019 Rotational Diversity in Multi-Cycle Assignment Problems AAAI 2019 Sampling Sketches for Concave Sublinear Functions of Frequencies NeurIPS 2019 SAT-Based Explicit LTLf Satisfiability Checking AAAI 2019 Sharpness of the Satisfiability Threshold for Non-Uniform Random k-SAT IJCAI 2019 Sliding Window Temporal Graph Coloring AAAI 2019 Smoothing Structured Decomposable Circuits NeurIPS 2019 Solving Empirical Risk Minimization in the Current Matrix Multiplication Time COLT 2019 Solving Integer Quadratic Programming via Explicit and Structural Restrictions AAAI 2019 Solving the Satisfiability Problem of Modal Logic S5 Guided by Graph Coloring IJCAI 2019 Space and Time Efficient Kernel Density Estimation in High Dimensions NeurIPS 2019 Spectral Modification of Graphs for Improved Spectral Clustering NeurIPS 2019 SPoC: Search-based Pseudocode to Code NeurIPS 2019 Stochastic Continuous Greedy ++: When Upper and Lower Bounds Match NeurIPS 2019 Sublinear Time Nearest Neighbor Search over Generalized Weighted Space ICML 2019 Subquadratic High-Dimensional Hierarchical Clustering NeurIPS 2019 Supervised User Ranking in Signed Social Networks AAAI 2019 Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding AAAI 2019 SySCD: A System-Aware Parallel Coordinate Descent Algorithm NeurIPS 2019 Teaching Multiple Concepts to a Forgetful Learner NeurIPS 2019 The Complexity of Model Checking Knowledge and Time IJCAI 2019