1: DEX: Self-healing Expanders
2: Proximal Newton-type methods for minimizing composite functions
3: Exponential Time Complexity of the Permanent and the Tutte Polynomial
4: Efficient Algorithms for Finding Tucker Patterns
5: On the Complexity of Minimum Labeling Alignment of Two Genomes
6: Dimension Independent Similarity Computation
7: Better bounds for matchings in the streaming model
8: Generic Subsequence Matching Framework: Modularity, Flexibility, Efficiency
9: Binary Jumbled String Matching for Highly Run-Length Compressible Texts
10: IDS: An Incremental Learning Algorithm for Finite Automata
11: Adaptive Inference on General Graphical Models
12: Learning Inclusion-Optimal Chordal Graphs
13: Complexity of Inference in Graphical Models
14: Tightening LP Relaxations for MAP using Message Passing