Algorithms

Incremental Symmetry Breaking Constraints for Graph Search Problems AAAI 2020 Individual-Based Stability in Hedonic Diversity Games AAAI 2020 Instead of Rewriting Foreign Code for Machine Learning, Automatically Synthesize Fast Gradients NeurIPS 2020 Inverse Rectification for Efficient Procam Pattern Correspondence WACV 2020 Iterative-Deepening Conflict-Based Search IJCAI 2020 Justifying All Differences Using Pseudo-Boolean Reasoning AAAI 2020 Keeping Your Friends Close: Land Allocation with Friends IJCAI 2020 Learning-Augmented Data Stream Algorithms ICLR 2020 Learning Context-free Languages with Nondeterministic Stack RNNs CoNLL 2020 Learning Invariants through Soft Unification NeurIPS 2020 Learning Optimal Decision Trees Using Caching Branch-and-Bound Search AAAI 2020 Lifting Preferences over Alternatives to Preferences over Sets of Alternatives: The Complexity of Recognizing Desirable Families of Sets AAAI 2020 Lower Bounds and Faster Algorithms for Equality Constraints IJCAI 2020 Lower Bounds for Approximate Knowledge Compilation IJCAI 2020 MAGSAC++, a Fast, Reliable and Accurate Robust Estimator CVPR 2020 Manipulating Districts to Win Elections: Fine-Grained Complexity AAAI 2020 Measuring Mutual Information Between All Pairs of Variables in Subquadratic Complexity AISTATS 2020 Microsecond Consensus for Microsecond Applications OSDI 2020 Minimal Solutions to Relative Pose Estimation From Two Views Sharing a Common Direction With Unknown Focal Length CVPR 2020 Mitigating Manipulation in Peer Review via Randomized Reviewer Assignments NeurIPS 2020 Multi-Tiered Strictly Local Functions ACL 2020 NLocalSAT: Boosting Local Search with Solution Prediction IJCAI 2020 Norm-Explicit Quantization: Improving Vector Quantization for Maximum Inner Product Search AAAI 2020 NuCDS: An Efficient Local Search Algorithm for Minimum Connected Dominating Set IJCAI 2020 On Adaptive Distance Estimation NeurIPS 2020