1: An Efficient Finite Tree Automata Library
2: Approximation of Points on Low-Dimensional Manifolds Via Random Linear Projections
3: Testing Formula Satisfaction
4: Efficient sub-5 approximations for minimum dominating sets in unit disk graphs
5: Distributed Learning, Communication Complexity and Privacy
6: An Algorithmic Solution for Computing Circle Intersection Areas and its Applications to Wireless Communications
7: The Wavelet Trie: Maintaining an Indexed Sequence of Strings in Compressed Space
8: A Cheeger Inequality for the Graph Connection Laplacian
9: Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis
10: Coalescing random walks and voting on connected graphs
11: Beyond Random Walk and Metropolis-Hastings Samplers: Why You Should Not Backtrack for Unbiased Graph Sampling
12: Connectivity Oracles for Planar Graphs
13: Folded Codes from Function Field Towers and Improved Optimal Rate List Decoding
14: Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms
15: (Non-)existence of Polynomial Kernels for the Test Cover Problem
16: Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash
17: Sorted Range Reporting
18: A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint
19: A Tight Linearization Strategy for Zero-One Quadratic Programming Problems
20: Finding Small Sparse Cuts Locally by Random Walk
21: Markov chain methods for small-set expansion
22: Dynamic Planar Point Location with Sub-Logarithmic Local Updates
23: String Trees