1: Bounds on quantum evolution complexity via lattice cryptography
2: Quantum jumbled pattern matching
3: Private Frequency Estimation via Projective Geometry
4: Ordered Submodularity and its Applications to Diversifying Recommendations
5: Private Convex Optimization via Exponential Mechanism
6: Online Unit Profit Knapsack with Untrusted Predictions
7: ONBRA: Rigorous Estimation of the Temporal Betweenness Centrality in Temporal Networks
8: Maximum Flow and Minimum-Cost Flow in Almost-Linear Time
9: Near-Linear Time Approximations for Cut Problems via Fair Cuts
10: An Accelerated Stochastic Algorithm for Solving the Optimal Transport Problem
11: Implications of Distance over Redistricting Maps: Central and Outlier Maps
12: Sampling Ex-Post Group-Fair Rankings
13: Pattern Recognition and Event Detection on IoT Data-streams
14: Truthful Online Scheduling of Cloud Workloads under Uncertainty
15: Coresets remembered and items forgotten: submodular maximization with deletions
16: Sparse Matrix Multiplication in the Low-Bandwidth Model
17: Descending Price Auctions with Bounded Number of Price Levels and Batched Prophet Inequality
18: Near-Optimal Correlation Clustering with Privacy
19: Private High-Dimensional Hypothesis Testing
20: A Formalisation of Algorithms for Sorting Network
21: Uniform Approximations for Randomized Hadamard Transforms with Applications
22: High Multiplicity Scheduling on Uniform Machines in FPT-Time
23: Improved Approximation Algorithms and Lower Bounds for Search-Diversification Problems
24: Differentially Private Label Protection in Split Learning
25: Improving \textit{Tug-of-War} sketch using Control-Variates method
26: The Sherali-Adams Hierarchy for Promise CSPs through Tensors
27: Beyond Time Complexity: Data Movement Complexity Analysis for Matrix Multiplication
28: Online List Labeling: Breaking the $\log^2n$ Barrier
29: A Robust Spectral Algorithm for Overcomplete Tensor Decomposition
30: pylspack: Parallel algorithms and data structures for sketching, column subset selection, regression and leverage scores
31: Distributional Hardness Against Preconditioned Lasso via Erasure-Robust Designs
32: The Power of Multiple Choices in Online Stochastic Matching
33: Locally checkable problems parameterized by clique-width
34: Distributed distance domination in graphs with no $K_{2,t}$-minor
35: Few Induced Disjoint Paths for $H$-Free Graphs
36: Online Matching with Convex Delay Costs
37: Turbocharging Heuristics for Weak Coloring Numbers