1: Grammar-Based Construction of Indexes for Binary Jumbled Pattern Matching
2: Near Optimal Leader Election in Multi-Hop Radio Networks
3: Optimal Covering with Mobile Sensors in an Unbounded Region
4: Improved Time Complexity of Bandwidth Approximation in Dense Graphs
5: Approximating $k$-Median via Pseudo-Approximation
6: Time-Space Trade-Offs for Longest Common Extensions
7: A Note on Circular Arc Online Coloring using First Fit
8: Non-redundant random generation algorithms for weighted context-free languages
9: Sketched SVD: Recovering Spectral Features from Compressive Measurements
10: Below All Subsets for Some Permutational Counting Problems
11: Parameterized Complexity and Kernel Bounds for Hard Planning Problems
12: Sharp Bounds on Random Walk Eigenvalues via Spectral Embedding
13: The complexity of learning halfspaces using generalized linear methods
14: A Simple Algorithm for Computing BOCP
15: Faster Approximation of Max Flow for Directed Graphs
16: Differential Privacy for the Analyst via Private Equilibrium Computation
17: Self-improving Algorithms for Coordinate-Wise Maxima and Convex Hulls
18: Beyond Worst-Case Analysis in Private Singular Vector Computation
19: A Linear Kernel for Planar Total Dominating Set
20: New constructions of RIP matrices with fast multiplication and fewer rows
21: Sparsity Lower Bounds for Dimensionality Reducing Maps
22: OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings
23: Algorithms and Hardness for Robust Subspace Recovery
24: How Robust are Linear Sketches to Adaptive Inputs?
25: A PRG for Lipschitz Functions of Polynomials with Applications to Sparsest Cut
26: Stochastic Combinatorial Optimization via Poisson Approximation
27: Myhill-Nerode methods for hypergraphs
28: Shattering, Graph Orientations, and Connectivity
29: Derivation of fast DCT algorithms using algebraic technique based on Galois theory
30: Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time
31: Fast Hamiltonicity checking via bases of perfect matchings