1: z-anonymity: Zero-Delay Anonymization for Data Streams
2: Fundamentals of Partial Rejection Sampling
3: Optimization-friendly generic mechanisms without money
4: Asymptotically Optimal Locally Private Heavy Hitters via Parameterized Sketches
5: Scaling Neural Tangent Kernels via Sketching and Random Features
6: On the Queue Number of Planar Graphs
7: When a system of real quadratic equations has a solution
8: A Linear-Time $n^{0.4}$-Approximation for Longest Common Subsequence
9: Spoofing Generalization: When Can’t You Trust Proprietary Models?
10: Learning-based Support Estimation in Sublinear Time
11: Correlation Clustering in Constant Many Parallel Rounds
12: Clustering Mixture Models in Almost-Linear Time via List-Decodable Mean Estimation
13: Maxmin-Fair Ranking: Individual Fairness under Group-Fairness Constraints
14: High-Quality Hypergraph Partitioning
15: On the Power of Preconditioning in Sparse Linear Regression
16: Identifiability of AMP chain graph models
17: Similarity of particle systems using an invariant root mean square deviation measure
18: Stochastic Bias-Reduced Gradient Methods
19: A Short Note of PAGE: Optimal Convergence Rates for Nonconvex Optimization
20: Statistical Query Lower Bounds for List-Decodable Linear Regression
21: Shuffle Private Stochastic Convex Optimization
22: Faster Sparse Matrix Inversion and Rank Computation in Finite Fields
23: Envy-freeness and Relaxed Stability for Lower-Quotas : A Parameterized Perspective
24: Approximation Algorithms for Two-Bar Charts Packing Problem
25: Differentially Private Sparse Vectors with Low Error, Optimal Space, and Fast Access
26: Beating the Folklore Algorithm for Dynamic Matching
27: Towards a Query-Optimal and Time-Efficient Algorithm for Clustering with a Faulty Oracle
28: Sublinear Time Hypergraph Sparsification via Cut and Edge Sampling Queries
29: Checking whether a word is Hamming-isometric in linear time
30: Hole Detection and Healing in Hybrid Sensor Networks
31: Near-Optimal Pool Testing under Urgency Constraints
32: A PTAS for $k$-hop MST on the Euclidean plane: Improving Dependency on $k$