Foundations

A Unified Framework for Spectral Clustering in Sparse Graphs JMLR 2021 Automatic Optimal Multi-Agent Path Finding Algorithm Selector (Student Abstract) AAAI 2021 Average-Case Communication Complexity of Statistical Problems COLT 2021 Backdoor Decomposable Monotone Circuits and Propagation Complete Encodings AAAI 2021 BernNet: Learning Arbitrary Graph Spectral Filters via Bernstein Approximation NeurIPS 2021 Bounded Memory Active Learning through Enriched Queries COLT 2021 Breaking The Dimension Dependence in Sparse Distribution Estimation under Communication Constraints COLT 2021 Bringing UMAP Closer to the Speed of Light with GPU Acceleration AAAI 2021 Cardinality constrained submodular maximization for random streams NeurIPS 2021 Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs AAAI 2021 Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable AAAI 2021 Computing Optimal Hypertree Decompositions with SAT IJCAI 2021 Connect Multi-Agent Path Finding: Generation and Visualization IJCAI 2021 Consensus Maximisation Using Influences of Monotone Boolean Functions CVPR 2021 Constraint-Driven Learning of Logic Programs AAAI 2021 Crossing Cuts Polygonal Puzzles: Models and Solvers CVPR 2021 Cyclically Equivariant Neural Decoders for Cyclic Codes ICML 2021 Decoupling the Depth and Scope of Graph Neural Networks NeurIPS 2021 Deep Graph Spectral Evolution Networks for Graph Topological Evolution AAAI 2021 Deep Hough Voting for Robust Global Registration ICCV 2021 Deep Latent Graph Matching ICML 2021 DEEPSPLIT: An Efficient Splitting Method for Neural Network Verification via Indirect Effect Analysis IJCAI 2021 Dimensionality Reduction for the Sum-of-Distances Metric ICML 2021 Diversity in Kemeny Rank Aggregation: A Parameterized Approach IJCAI 2021 Dynamic Proportional Rankings IJCAI 2021