| Publication | Date of Publication | Type |
|---|
| Streaming euclidean k-median and k-means with o( n) space | 2025-08-15 | Paper |
| Tight bounds for adversarially robust streams and sliding windows via difference estimators | 2025-08-13 | Paper |
| Near optimal linear algebra in the online and sliding window models | 2025-08-12 | Paper |
| Private data stream analysis for universal symmetric norm estimation | 2025-01-14 | Paper |
| How to make your approximation algorithm private: a black-box differentially-private transformation for tunable approximation algorithms of functions with low sensitivity | 2025-01-14 | Paper |
| Differentially private aggregation via imperfect shuffling | 2024-11-22 | Paper |
| Adaptive sketches for robust regression with importance sampling | 2024-08-22 | Paper |
| Near-linear sample complexity for \(L_p\) polynomial regression | 2024-05-14 | Paper |
| Optimal algorithms for linear algebra in the current matrix multiplication time | 2024-05-14 | Paper |
| Fast Fourier sparsity testing | 2024-05-14 | Paper |
Bandwidth-Hard Functions: Reductions and Lower Bounds
Journal of Cryptology | 2024-04-21 | Paper |
scientific article; zbMATH DE number 7829323 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
On differential privacy and adaptive data analysis with bounded space
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-12 | Paper |
Memory bounds for the experts problem
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
On locally decodable codes in resource bounded channels
(available as arXiv preprint) | 2023-11-02 | Paper |
On the security of proofs of sequential work in a post-quantum world
(available as arXiv preprint) | 2023-07-03 | Paper |
Symmetric norm estimation and regression on sliding windows
(available as arXiv preprint) | 2023-03-30 | Paper |
scientific article; zbMATH DE number 7650384 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Improved Algorithms for Time Decay Streams
(available as arXiv preprint) | 2023-02-03 | Paper |
Approximate F_2-Sketching of Valuation Functions
(available as arXiv preprint) | 2023-02-03 | Paper |
scientific article; zbMATH DE number 7650361 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
| A fast, provably accurate approximation algorithm for sparse principal component analysis reveals human genetic variation across the world | 2022-08-30 | Paper |
| Dimensionality Reduction for Wasserstein Barycenter | 2021-10-17 | Paper |
Nearly optimal distinct elements and heavy hitters on sliding windows
(available as arXiv preprint) | 2021-08-04 | Paper |
Streaming periodicity with mismatches
(available as arXiv preprint) | 2021-07-28 | Paper |
| scientific article; zbMATH DE number 7376033 (Why is no real title available?) | 2021-07-28 | Paper |
Relaxed Locally Correctable Codes in Computationally Bounded Channels
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
On the computational complexity of minimal cumulative cost graph pebbling
(available as arXiv preprint) | 2021-03-17 | Paper |
Non-adaptive adaptive sampling on turnstile streams
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Streaming for aibohphobes: longest palindrome with mismatches
(available as arXiv preprint) | 2020-11-25 | Paper |
| Data-independent memory hard functions: new attacks and stronger constructions | 2020-03-09 | Paper |
Periodicity in data streams with wildcards
Theory of Computing Systems | 2020-02-27 | Paper |
Nearly Optimal Sparse Group Testing
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Structural results on matching estimation with applications to streaming
Algorithmica | 2019-01-11 | Paper |
Periodicity in data streams with wildcards
Lecture Notes in Computer Science | 2018-11-28 | Paper |
| On the depth-robustness and cumulative pebbling cost of Argon2i | 2018-01-19 | Paper |
