1: A space- and time-efficient Implementation of the Merkle Tree Traversal Algorithm
2: Facility location problems in the constant work-space read-only memory model
3: The Ordered Weighted $\ell_1$ Norm: Atomic Formulation, Projections, and Algorithms
4: Planar Embeddings with Small and Uniform Faces
5: Fast algorithmic self-assembly of simple shapes using random agitation
6: Improved Algorithms for Distributed Entropy Monitoring
7: Finding Even Subgraphs Even Faster
8: Probabilistic analysis of the (1+1)-evolutionary algorithm
9: Rank Maximal Matchings – Structure and Algorithms
10: RoBuSt: A Crash-Failure-Resistant Distributed Storage System
11: Identifying sparse and dense sub-graphs in large graphs with a fast algorithm
12: A Tabu Search Algorithm for the Multi-period Inspector Scheduling Problem
13: Local Algorithms for Graphs
14: Solving the Maximum-Weight Connected Subgraph Problem to Optimality
15: Differentially Private Linear Algebra in the Streaming Model
16: Windows into Geometric Events: Data Structures for Time-Windowed Querying of Temporal Point Sets
17: Replacing the Irreplaceable: Fast Algorithms for Team Member Recommendation
18: Approximating the generalized terminal backup problem via half-integral multiflow relaxation
19: Lempel-Ziv Factorization May Be Harder Than Computing All Runs
20: Intel Cilk Plus for Complex Parallel Algorithms: “Enormous Fast Fourier Transform” (EFFT) Library
21: Tight Error Bounds for Structured Prediction
22: Maximizing Symmetric Submodular Functions