1: Low-Memory Adaptive Prefix Coding
2: Revisiting Norm Estimation in Data Streams
3: Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem
4: Communication Efficiency in Self-stabilizing Silent Protocols
5: Finding Sparse Cuts Locally Using Evolving Sets
6: The Simultaneous Membership Problem for Chordal, Comparability and Permutation graphs
7: Search Result Clustering via Randomized Partitioning of Query-Induced Subgraphs
8: Dynamic Indexability: The Query-Update Tradeoff for One-Dimensional Range Queries
9: How robust is quicksort average complexity?
10: Compact Labelings For Efficient First-Order Model-Checking