1: Private Lossless Multiple Release
2: Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval
3: Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood
4: Fast Isotropic Median Filtering
5: Improved Learning via k-DTW: A Novel Dissimilarity Measure for Curves
6: The Generalized Skew Spectrum of Graphs
7: Differentially Private Space-Efficient Algorithms for Counting Distinct Elements in the Turnstile Model
8: Fast Compressed-Domain N-Point Discrete Fourier Transform: The “Twiddless” FFT Algorithm
9: Improved Approximations for Hard Graph Problems using Predictions
10: Approximate Light Spanners in Planar Graphs
11: Tradeoffs between Mistakes and ERM Oracle Calls in Online and Transductive Online Learning
12: Randomized Dimensionality Reduction for Euclidean Maximization and Diversity Measures
13: Faster negative length shortest paths by bootstrapping hop reducers