1: Smooth Nash Equilibria: Algorithms and Complexity
2: User-Level Differential Privacy With Few Examples Per User
3: Mildly Exponential Lower Bounds on Tolerant Testers for Monotonicity, Unateness, and Juntas
4: A Detailed Analysis of the SpaceSaving$\pm$ Family of Algorithms with Bounded Deletions
5: OneNet: Enhancing Time Series Forecasting Models under Concept Drift by Online Ensembling
6: Fixed confidence community mode estimation
7: Dynamic “Succincter”
8: Faster Approximate All Pairs Shortest Paths
9: Conjunctive Queries on Probabilistic Graphs: The Limits of Approximability
10: Infeasibility of constructing a special orthogonal matrix for the deterministic remote preparation of arbitrary n-qubit state
11: Online Bin Covering with Exact Parameter Advice
12: Reserve Matching with Thresholds
13: A simple linear-time algorithm for generating auxiliary 3-edge-connected subgraphs
14: Identification of Mixtures of Discrete Product Distributions in Near-Optimal Sample and Time Complexity
15: A unified worst case for classical simplex and policy iteration pivot rules
16: The Upper Clique Transversal Problem
17: An optimized quantum minimum searching algorithm with sure-success probability and its experiment simulation with Cirq
18: Temporal Separators with Deadlines
19: Revisiting Tree Isomorphism: An Algorithmic Bric-`a-Brac
20: Bicriteria Approximation Algorithms for the Submodular Cover Problem
21: On Deterministically Approximating Total Variation Distance
22: On the Advice Complexity of Online Unit Clustering
23: Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares
24: Planted Random Number Partitioning Problem
25: Generalised 3D Morton and Hilbert Orderings
26: Composable Coresets for Determinant Maximization: Greedy is Almost Optimal
27: On the Power of SVD in the Stochastic Block Model
28: Multi-dimensional Data Quick Query for Blockchain-based Federated Learning
29: A smoothed-Bayesian approach to frequency recovery from sketched data
30: Computing Permanents and Counting Hamiltonian Cycles Faster
31: The $st$-Planar Edge Completion Problem is Fixed-Parameter Tractable
32: Fast Locality Sensitive Hashing with Theoretical Guarantee
33: Sidestepping Barriers for Dominating Set in Parameterized Complexity
34: Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time
35: Minimum Monotone Tree Decomposition of Density Functions Defined on Graphs
36: An algorithm for $g$-invariant on unary Hermitian lattices over imaginary quadratic fields
37: Sampling Methods for Inner Product Sketching
38: Matrix Multiplication Verification Using Coding Theory
39: Cut a Numeric String into Required Pieces