1: On Computing Exact Means of Time Series Using the Move-Split-Merge Metric
2: The minimal canonical form of a tensor network
3: Repeated Prophet Inequality with Near-optimal Bounds
4: Shortest Beer Path Queries in Interval Graphs
5: Efficient parameterized algorithms on graphs with heterogeneous structure: Combining tree-depth and modular-width
6: On Quantum Speedups for Nonconvex Optimization via Quantum Tunneling Walks
7: Matroid Intersection under Restricted Oracles
8: Tensor-Based Sketching Method for the Low-Rank Approximation of Data Streams
9: A dichotomy for succinct representations of homomorphisms
10: Fully Lattice Linear Algorithms
11: On Constructing Spanners from Random Gaussian Projections
12: On the Convergence of AdaGrad(Norm) on $\R^{d}$: Beyond Convexity, Non-Asymptotic Rate and Acceleration
13: Low-Latency Sliding Window Algorithms for Formal Languages
14: META-STORM: Generalized Fully-Adaptive Variance Reduced SGD for Unbounded Functions
15: Enumerating Regular Languages with Bounded Delay
16: Optimal Query Complexities for Dynamic Trace Estimation
17: Assortment Optimization Under the Multivariate MNL Model
18: Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks
19: Proportionally Fair Online Allocation of Public Goods with Predictions
20: Local dominance unveils clusters in networks