1: Fast Algorithm for Partial Covers in Words
2: Sparse Recovery with Very Sparse Compressed Counting
3: Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs
4: Robust Hierarchical Clustering
5: Counting Terms in the Binary Lambda Calculus
6: Faster 3-Periodic Merging Networks
7: Faster SVD-Truncated Least-Squares Regression
8: On Minimum Average Stretch Spanning Trees in Polygonal 2-trees
9: More Algorithms for Provable Dictionary Learning
10: Space-Efficient String Indexing for Wildcard Pattern Matching
11: Nonuniform Graph Partitioning with Unrelated Weights
12: A Parallel Space Saving Algorithm For Frequent Items and the Hurwitz zeta distribution
13: A Search Procedure for Cyclic Subsets
14: Maintaining partial sums in logarithmic time
15: Linear time construction of compressed text indices in compact space
16: Distribution-Sensitive Construction of the Greedy Spanner
17: Efficient random sampling of binary and unary-binary trees via holonomic equations
18: Interpolation and Approximation of Polynomials in Finite Fields over a Short Interval from Noisy Values