Foundations

Composable Sketches for Functions of Frequencies: Beyond the Worst Case ICML 2020 Computational Aspects of Conditional Minisum Approval Voting in Elections with Interdependent Issues IJCAI 2020 Constructing Minimal Perfect Hash Functions Using SAT Technology AAAI 2020 Contiguous Cake Cutting: Hardness Results and Approximation Algorithms AAAI 2020 Costly Zero Order Oracles COLT 2020 Cost Volume Pyramid Based Depth Inference for Multi-View Stereo CVPR 2020 Decidability and Complexity of Action-Based Temporal Planning over Dense Time AAAI 2020 Deciding Acceptance in Incomplete Argumentation Frameworks AAAI 2020 Defending with Shared Resources on a Network AAAI 2020 Delete- and Ordering-Relaxation Heuristics for HTN Planning IJCAI 2020 Diamond-Miner: Comprehensive Discovery of the Internet's Topology Diamonds NSDI 2020 Digraph Inception Convolutional Networks NeurIPS 2020 Discovering conflicting groups in signed networks NeurIPS 2020 Discovering Synchronized Subsets of Sequences: A Large Scale Solution CVPR 2020 Do Transformers Need Deep Long-Range Memory? ACL 2020 Dscorer: A Fast Evaluation Metric for Discourse Representation Structure Parsing ACL 2020 Dual Formulation of the Chordal Graph Conjecture PGM 2020 Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability AAAI 2020 Efficient and Robust Shape Correspondence via Sparsity-Enforced Quadratic Assignment CVPR 2020 Efficient Clustering Based On A Unified View Of K-means And Ratio-cut NeurIPS 2020 Efficient Heuristic Search for M-Modes Inference PGM 2020 Efficiently Enumerating Substrings with Statistically Significant Frequencies of Locally Optimal Occurrences in Gigantic String AAAI 2020 Electing Successive Committees: Complexity and Algorithms AAAI 2020 End-to-End Learning and Intervention in Games NeurIPS 2020 Envelope-Based Approaches to Real-Time Heuristic Search AAAI 2020