1: Improved distance sensitivity oracles via tree partitioning
2: Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths
3: Efficiently decodable insertion/deletion codes for high-noise and high-rate regimes
4: Efficient Construction of Probabilistic Tree Embeddings
5: Typical Performance of Approximation Algorithms for NP-hard Problems
6: Flexible Resource Allocation for Clouds and All-Optical Networks
7: Exact Online String Matching Bibliography
8: Enumeration of Enumeration Algorithms
9: Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks
10: The Non-uniform Fast Fourier Transform in Computed Tomography
11: Fast Concurrent Cuckoo Kick-Out Eviction Schemes for High-Density Tables
12: CSA++: Fast Pattern Search for Large Alphabets
13: Parallel Algorithms for Summing Floating-Point Numbers
14: Distributed Parallel D8 Up-Slope Area Calculation in Digital Elevation Models
15: Geometric Near-neighbor Access Tree (GNAT) revisited
16: Online purchasing under uncertainty
17: On Polynomial Time Approximation Bounded Solution for TSP and NP Complete Problems
18: Games from Basic Data Structures
19: Coresets for Scalable Bayesian Logistic Regression
20: Efficient and Compact Representations of Some Non-Canonical Prefix-Free Codes