Foundations

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 Mining Topological Structure in Graphs through Forest Representations JMLR 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 Node Embeddings and Exact Low-Rank Representations of Complex Networks NeurIPS 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 One-Shot Neural Architecture Search via Novelty Driven Sampling IJCAI 2020 On Metric DBSCAN with Low Doubling Dimension IJCAI 2020 On Testing of Samplers NeurIPS 2020 On the Complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules IJCAI 2020 On the Expressivity of ASK Queries in SPARQL AAAI 2020 On the Problem of Covering a 3-D Terrain AAAI 2020 Opening the Black Box: Automatically Characterizing Software for Algorithm Selection (Student Abstract) AAAI 2020