1: RecSplit: Minimal Perfect Hashing via Recursive Splitting
2: It is high time we let go of the Mersenne Twister
3: Principal Component Projection and Regression in Nearly Linear Time through Asymmetric SVRG
4: Apply Sorting Algorithms to FAST Problem
5: Flowless: Extracting Densest Subgraphs Without Flow Computations
6: Practical Random Access to SLP-Compressed Texts
7: Envy-freeness and Relaxed Stability under lower quotas
8: FISHDBC: Flexible, Incremental, Scalable, Hierarchical Density-Based Clustering for Arbitrary Data and Distance
9: Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem
10: Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs
11: The Distributed Bloom Filter
12: EvoZip: Efficient Compression of Large Collections of Evolutionary Trees
13: Engineering Top-Down Weight-Balanced Trees
14: Faster parameterized algorithm for Bicluter Editing
15: Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex
16: A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond
17: Solving Linear Programs with Sqrt(rank) Linear System Solves
18: Weighted Edge Sampling for Static Graphs
19: Approximating Weighted Completion Time for Order Scheduling with Setup Times
20: Temporal Network Sampling
21: Planted Models for $k$-way Edge and Vertex Expansion
22: A New Connection Between Node and Edge Depth Robust Graphs
23: Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity
24: SneakySnake: A Fast and Accurate Universal Genome Pre-Alignment Filter for CPUs, GPUs, and FPGAs
25: Classical algorithms, correlation decay, and complex zeros of partition functions of quantum many-body systems
26: Adaptive Learned Bloom Filter (Ada-BF): Efficient Utilization of the Classifier