1: Learning and Testing Variable Partitions
2: Intermittent Inverse-Square L'evy Walks are Optimal for Finding Targets of All Sizes
3: How the Degeneracy Helps for Triangle Counting in Graph Streams
4: How to Find a Point in the Convex Hull Privately
5: The One-way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness
6: Parallel Batch-Dynamic $k$-Clique Counting
7: A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem
8: Feedback Edge Sets in Temporal Graphs
9: A Framework for Adversarially Robust Streaming Algorithms