Foundations

The Parameterized Complexity of Cascading Portfolio Scheduling NeurIPS 2019 Total Least Squares Regression in Input Sparsity Time NeurIPS 2019 Toward Efficient Navigation of Massive-Scale Geo-Textual Streams IJCAI 2019 Towards a Zero-One Law for Column Subset Selection NeurIPS 2019 Towards Near-imperceptible Steganographic Text ACL 2019 Turkish Treebanking: Unifying and Constructing Efforts ACL 2019 Unbounded Orchestrations of Transducers for Manufacturing AAAI 2019 Very Hard Electoral Control Problems AAAI 2019 Weakly deterministic transformations are subregular ACL 2019 Adaptive Dynamic Checkpointing for Safe Efficient Intermittent Computing OSDI 2018 Adversarial Task Assignment IJCAI 2018 A Fast Algorithm for Generalized Arc Consistency of the Alldifferent Constraint IJCAI 2018 A Fast Algorithm for Optimally Finding Partially Disjoint Shortest Paths IJCAI 2018 A Fast Local Search Algorithm for Minimum Weight Dominating Set Problem on Massive Graphs IJCAI 2018 A GPU-based WFST Decoder with Exact Lattice Generation Interspeech 2018 Analyzing Tie-Breaking Strategies for the A* Algorithm IJCAI 2018 An Efficient Algorithm To Compute Distance Between Lexicographic Preference Trees IJCAI 2018 An Exact Algorithm for Maximum k-Plexes in Massive Graphs IJCAI 2018 An Operational Semantics for a Fragment of PRS IJCAI 2018 An Optimization Framework for Recovery of Speech from Phase-Encoded Spectrograms Interspeech 2018 Approximate Nearest Neighbors in Limited Space COLT 2018 A Reactive Strategy for High-Level Consistency During Search IJCAI 2018 ASAP: Fast, Approximate Graph Pattern Mining at Scale OSDI 2018 A Syntax-Based Scheme for the Annotation and Segmentation of German Spoken Language Interactions COLING 2018 A Theory-Based Evaluation of Nearest Neighbor Models Put Into Practice NeurIPS 2018