1: Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks – Extended version with an Improved Upper Bound –
2: A Faster Approximation Algorithm for the Gibbs Partition Function
3: Polynomial Representations of Threshold Functions and Algorithmic Applications
4: Parallel Non-divergent Flow Accumulation For Trillion Cell Digital Elevation Models On Desktops Or Clusters
5: An Improved Algorithm for Diameter-Optimally Augmenting Paths in a Metric Space
6: Lecture Notes on Randomized Linear Algebra
7: Optimization of Bootstrapping in Circuits
8: Faster Sublinear Algorithms using Conditional Sampling
9: Compact and Fast Sensitivity Oracles for Single-Source Distances
10: Faster Principal Component Regression and Stable Matrix Chebyshev Approximation
11: Lecture Notes on Spectral Graph Methods
12: Quicksort with median of medians is considered practical
13: Quicksort Is Optimal For Many Equal Keys
14: In-Place Sparse Suffix Sorting
15: Conditional Sparse Linear Regression
16: Tree-decomposable and Underconstrained Geometric Constraint Problems
17: Constant Factor Approximate Solutions for Expanding Search on General Networks
18: Shortest unique palindromic substring queries in optimal time
19: Thrill: High-Performance Algorithmic Distributed Batch Data Processing with C++
20: Linear Kernels for Separating a Graph into Components of Bounded Size