Foundations

Open Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection COLT 2020 Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization JMLR 2020 Optimization from Structured Samples for Coverage Functions ICML 2020 Optimizing Reachability Sets in Temporal Graphs by Delaying AAAI 2020 Orthogonal Relation Transforms with Graph Context Modeling for Knowledge Graph Embedding ACL 2020 Parallel Algorithm for Non-Monotone DR-Submodular Maximization ICML 2020 Pay Your Trip for Traffic Congestion: Dynamic Pricing in Traffic-Aware Road Networks AAAI 2020 Photometric Stereo via Discrete Hypothesis-and-Test Search CVPR 2020 Plankton: Scalable network configuration verification through model checking NSDI 2020 Polytime Decomposition of Generalized Submodular Base Polytopes with Efficient Sampling ACML 2020 Poset Representations for Sets of Elementary Triplets PGM 2020 Practical Frank–Wolfe Method with Decision Diagrams for Computing Wardrop Equilibrium of Combinatorial Congestion Games AAAI 2020 Programming in Natural Language with fuSE: Synthesizing Methods from Spoken Utterances Using Deep Natural Language Understanding ACL 2020 Provable Overlapping Community Detection in Weighted Graphs NeurIPS 2020 Proximity Preserving Binary Code Using Signed Graph-Cut AAAI 2020 Quasi-Newton Solver for Robust Non-Rigid Registration CVPR 2020 Randomness Efficient Feature Hashing for Sparse Binary Data ACML 2020 RedLeaf: Isolation and Communication in a Safe Operating System OSDI 2020 Reducibility and Statistical-Computational Gaps from Secret Leakage COLT 2020 Refining Tournament Solutions via Margin of Victory AAAI 2020 Rescore in a Flash: Compact, Cache Efficient Hashing Data Structures for n-Gram Language Models Interspeech 2020 Robust Multiple-Path Orienteering Problem: Securing Against Adversarial Attacks RSS 2020 Robustness of Community Detection to Random Geometric Perturbations NeurIPS 2020 Robust Tensor Decomposition via Orientation Invariant Tubal Nuclear Norms AAAI 2020 Scalable Nearest Neighbor Search for Optimal Transport ICML 2020