Foundations

Tight query complexity bounds for learning graph partitions COLT 2022 Toward Instance-Optimal State Certification With Incoherent Measurements COLT 2022 Towards Better Evaluation for Dynamic Link Prediction NeurIPS 2022 TPU-KNN: K Nearest Neighbor Search at Peak FLOP/s NeurIPS 2022 Tractable Explanations for d-DNNF Classifiers AAAI 2022 Triangle and Four Cycle Counting with Predictions in Graph Streams ICLR 2022 Trustworthy Monte Carlo NeurIPS 2022 Two Compacted Models for Efficient Model-Based Diagnosis AAAI 2022 Understanding Distance Measures Among Elections IJCAI 2022 Using MaxSAT for Efficient Explanations of Tree Ensembles AAAI 2022 Verification and search algorithms for causal DAGs NeurIPS 2022 Verifying Hardware Security Modules with Information-Preserving Refinement OSDI 2022 XRP: In-Kernel Storage Functions with eBPF OSDI 2022 A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs NeurIPS 2021 Active Learning of Convex Halfspaces on Graphs NeurIPS 2021 Additive Error Guarantees for Weighted Low Rank Approximation ICML 2021 A Decomposition Model for Stereo Matching CVPR 2021 A Faster Maximum Cardinality Matching Algorithm with Applications in Machine Learning NeurIPS 2021 A Fast Exact Algorithm for the Resource Constrained Shortest Path Problem AAAI 2021 An Automated Engineering Assistant: Learning Parsers for Technical Drawings AAAI 2021 A Novel Sequential Coreset Method for Gradient Descent Algorithms ICML 2021 Anytime Multi-Agent Path Finding via Large Neighborhood Search IJCAI 2021 Approximate Multiplication of Sparse Matrices with Limited Space AAAI 2021 A Root of a Problem: Optimizing Single-Root Dependency Parsing EMNLP 2021 A SAT-based Resolution of Lam's Problem AAAI 2021