1: Balls-and-Bins Sampling for DP-SGD
2: Algorithm Design for Continual Learning in IoT Networks
3: Efficiently Solving Turn-Taking Stochastic Games with Extensive-Form Correlation
4: Grams: Gradient Descent with Adaptive Momentum Scaling
5: Sparsest cut and eigenvalue multiplicities on low degree Abelian Cayley graphs
6: Online coloring of short interval graphs and two-count interval graphs
7: On the complexity of finding a spanning even tree in a graph
8: On the number of $k$-mers admitting a given lexicographical minimizer
9: Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks
10: Hiding, Shuffling, and Triangle Finding: Quantum Algorithms on Edge Lists
11: A mixing time bound for Gibbs sampling from log-smooth log-concave distributions
12: Shifted Composition III: Local Error Framework for KL Divergence
13: The Connected k-Vertex One-Center Problem on Graphs
14: Parallel Contraction Hierarchies Can Be Efficient and Scalable
15: Algorithmic Universality, Low-Degree Polynomials, and Max-Cut in Sparse Random Graphs
16: On the occupancy fraction of the antiferromagnetic Ising model
17: A Many Objective Problem Where Crossover is Provably Indispensable
18: Characterizations of Language Generation With Breadth
19: Faster Semi-streaming Matchings via Alternating Trees
20: A Space Lower Bound for Approximate Membership with Duplicate Insertions or Deletions of Nonelements
21: A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets
22: Distributed Download from an External Data Source in Faulty Majority Settings