1: On Efficient Range-Summability of Ideally IID Random Variables in Two or Higher Dimensions
2: Zipping Strategies and Attribute Grammars
3: Compact representation for matrices of bounded twin-width
4: Simplest Streaming Trees
5: Constructing Many Faces in Arrangements of Lines and Segments
6: Algorithmic Thresholds for Refuting Random Polynomial Systems
7: Terminal Embeddings in Sublinear Time
8: Faster Algorithms for Bounded-Difference Min-Plus Product
9: Online Facility Location with Predictions
10: On Monotonicity of Number-Partitioning Algorithms
11: Algorithms Using Local Graph Features to Predict Epidemics
12: Dimensionality Reduction for Wasserstein Barycenter
13: Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals
14: Diameter constrained Steiner tree and related problems
15: Data structure for node connectivity and cut queries
16: Machine Covering in the Random-Order Model
17: Anti-Factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)
18: Near-Optimal Quantum Algorithms for String Problems
19: Collective Shortest Paths for Minimizing Congestion on Temporal Load-Aware Road Networks
20: Exploring the Gap between Tolerant and Non-tolerant Distribution Testing
21: Factorial Lower Bounds for (Almost) Random Order Streams
22: Matrix Discrepancy from Quantum Communication
23: FriendlyCore: Practical Differentially Private Aggregation
24: Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry
25: Fast Bitmap Fit: A CPU Cache Line friendly memory allocator for single object allocations
26: Predicting parameters for the Quantum Approximate Optimization Algorithm for MAX-CUT from the infinite-size limit
27: Part-X: A Family of Stochastic Algorithms for Search-Based Test Generation with Probabilistic Guarantees
28: Balanced Allocations: Caching and Packing, Twinning and Thinning
29: Dynamic Bipartite Matching Market with Arrivals and Departures
30: The popular assignment problem: when cardinality is more important than popularity