1: On $L^q$ Convergence of the Hamiltonian Monte Carlo
2: Work-sensitive Dynamic Complexity of Formal Languages
3: An in-place truncated Fourier transform
4: Adversarial Laws of Large Numbers and Optimal Regret in Online Classification
5: Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity
6: Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes
7: Complexity of Linear Minimization and Projection on Some Sets
8: Constant Amortized Time Enumeration of Eulerian trails
9: Hierarchical Clustering via Sketches and Hierarchical Correlation Clustering
10: The Langevin Monte Carlo algorithm in the non-smooth log-concave case
11: A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs
12: Spanner Evaluation over SLP-Compressed Documents
13: Large-Scale Benchmarks for the Job Shop Scheduling Problem
14: Separating Adaptive Streaming from Oblivious Streaming
15: On statistical inference when fixed points of belief propagation are unstable
16: Online Network Utility Maximization: Algorithm, Competitive Analysis, and Applications
17: Sampling a Near Neighbor in High Dimensions – Who is the Fairest of Them All?
18: On formal concepts of random formal contexts
19: Complementary Composite Minimization, Small Gradients in General Norms, and Applications
20: REFORM: Fast and Adaptive Solution for Subteam Replacement
21: Faster Algorithm for Maximum Flow in Directed Planar Graphs with Vertex Capacities
22: Entropy of Mersenne-Twisters
23: Deriving monadic quicksort (Declarative Pearl)
24: Polynomial Time $k$-Shortest Multi-Criteria Prioritized and All-Criteria-Disjoint Paths
25: A Neighborhood-preserving Graph Summarization
26: Random Graph Matching with Improved Noise Robustness