1: On Maximizing Sums of Non-monotone Submodular and Linear Functions
2: Efficient Algorithms for Sorting in Trees
3: Learning (Very) Simple Generative Models Is Hard
4: The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut
5: Accelerated first-order methods for a class of semidefinite programs
6: String Attractors and Infinite Words
7: Minimum-Cost Flows Over Time
8: Control hubs of complex networks and a polynomial-time identification algorithm
9: Subexponential mixing for partition chains on grid-like graphs
10: Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
11: Learning-Augmented Algorithms for Online TSP on the Line
12: Algorithmic Applications of Tree-Cut Width
13: Near-Optimal Search Time in $\delta$-Optimal Space, and Vice Versa
14: The Power of Amortized Recourse for Online Graph Problems
15: Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors
16: Max-Weight Online Stochastic Matching: Improved Approximations Against the Online Benchmark
17: Balancing Flow Time and Energy Consumption
18: Falconn++: A Locality-sensitive Filtering Approach for Approximate Nearest Neighbor Search
19: A closer look at TDFA
20: Improved Deterministic Connectivity in Massively Parallel Computation
21: RODIAN: Robustified Median
22: L-systems for Measuring Repetitiveness(star)
23: Weighted Model Counting with Twin-Width
24: Advantages and limitations of quantum routing
25: Onesweep: A Faster Least Significant Digit Radix Sort for GPUs
26: Finite-Sample Maximum Likelihood Estimation of Location
27: Optimal Stopping Theory for a Distributionally Robust Seller
28: Individual Privacy Accounting for Differentially Private Stochastic Gradient Descent
29: Communication-constrained hypothesis testing: Optimality, robustness, and reverse data processing inequalities
30: Optimal Adjacency Labels for Subgraphs of Cartesian Products
31: A semi-conjugate gradient method for solving unsymmetric positive definite linear systems
32: Locality-sensitive bucketing functions for the edit distance
33: Fast Exact String to D-Texts Alignments
34: A Differentially Private Linear-Time fPTAS for the Minimum Enclosing Ball Problem