1: Fast Scalable Construction of (Minimal Perfect Hash) Functions
2: An optimal algorithm for bandit convex optimization
3: A Fast Parameterized Algorithm for Co-Path Set
4: Linear Sum Assignment with Edition
5: The Quadratic Minimum Spanning Tree Problem and its Variations
6: Matching while Learning
7: A branch and bound algorithm for a fractional 0-1 programming problem
8: ND-Tree-based update: a Fast Algorithm for the Dynamic Non-Dominance Problem
9: The landscape of bounds for binary search trees
10: Parallel Algorithms for Select and Partition with Noisy Comparisons
11: An Approximate Dynamic Programming Approach to Adversarial Online Learning
12: Benchmarking Concurrent Priority Queues: Performance of k-LSM and Related Data Structures
13: On the effect of randomness on planted 3-coloring models
14: Optimal Quantile Approximation in Streams
15: Improved Approximation for Node-Disjoint Paths in Planar Graphs
16: ABCDepth: efficient algorithm for Tukey depth
17: Streaming Algorithms for News and Scientific Literature Recommendation: Submodular Maximization with a d-Knapsack Constraint
18: Optimal Black-Box Reductions Between Optimization Objectives
19: Variance Reduction for Faster Non-Convex Optimization
20: Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem
21: Empirical Evaluation of a Thread-Safe Dynamic Range Min-Max Tree using HTM
22: Parameterized vertex deletion problems for hereditary graph classes with a block property
23: Katyusha: The First Direct Acceleration of Stochastic Gradient Methods
24: A Message Passing Algorithm for the Problem of Path Packing in Graphs
25: Better bounds for coalescing-branching random walks
26: An Approximation Approach for Solving the Subpath Planning Problem