Foundations

The Power of Literal Equivalence in Model Counting AAAI 2021 The Sparse Vector Technique, Revisited COLT 2021 The Traveling Tournament Problem with Maximum Tour Length Two: A Practical Algorithm with An Improved Approximation Bound IJCAI 2021 Toward Determining NFA Equivalence via QBFs (Student Abstract) AAAI 2021 Towards a Query-Optimal and Time-Efficient Algorithm for Clustering with a Faulty Oracle COLT 2021 Towards More Practical and Efficient Automatic Dominance Breaking AAAI 2021 Unitary Branching Programs: Learnability and Lower Bounds ICML 2021 VSAC: Efficient and Accurate Estimator for H and F ICCV 2021 Winner Determination and Strategic Control in Conditional Approval Voting IJCAI 2021 Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments IJCAI 2021 A Cardinal Improvement to Pseudo-Boolean Solving AAAI 2020 Action Graphs for Goal Recognition Problems with Inaccurate Initial States (Student Abstract) AAAI 2020 Adapting Stable Matchings to Evolving Preferences AAAI 2020 Adaptive Learned Bloom Filter (Ada-BF): Efficient Utilization of the Classifier with Application to Real-Time Information Filtering on the Web NeurIPS 2020 Adaptive Probing Policies for Shortest Path Routing NeurIPS 2020 Adaptive Shrinkage Estimation for Streaming Graphs NeurIPS 2020 A determinantal point process for column subset selection JMLR 2020 A Game Theoretic Approach For Core Resilience IJCAI 2020 A Graduated Filter Method for Large Scale Robust Estimation CVPR 2020 A Learning Based Branch and Bound for Maximum Common Subgraph Related Problems AAAI 2020 Almost No News on the Complexity of MAP in Bayesian Networks PGM 2020 A mathematical model for automatic differentiation in machine learning NeurIPS 2020 A MaxSAT-Based Framework for Group Testing AAAI 2020 An Õ(m/ε^3.5)-Cost Algorithm for Semidefinite Programs with Diagonal Constraints COLT 2020 An Algorithm for Multi-Attribute Diverse Matching IJCAI 2020