| Publication | Date of Publication | Type |
|---|
| Differentially private aggregation via imperfect shuffling | 2024-11-22 | Paper |
| Generalized private selection and testing with high confidence | 2024-09-25 | Paper |
| Private counting of distinct and \(k\)-occurring items in time windows | 2024-09-25 | Paper |
Terminal embeddings in sublinear time
TheoretiCS | 2024-07-03 | Paper |
| Differentially private all-pairs shortest path distances: improved algorithms and lower bounds | 2024-05-14 | Paper |
| Optimal differentially private learning of thresholds and quasi-concave optimization | 2024-05-08 | Paper |
Forty years of frequent items
International Congress of Mathematicians | 2024-03-20 | Paper |
Uniform approximations for Randomized Hadamard Transforms with applications
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Continuous monitoring of \(\ell_p\) norms in data streams
(available as arXiv preprint) | 2021-07-28 | Paper |
Dimensionality Reduction in Euclidean Space
Notices of the American Mathematical Society | 2021-02-11 | Paper |
Optimal terminal dimensionality reduction in Euclidean space
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Heavy Hitters and the Structure of Local Privacy
ACM Transactions on Algorithms | 2019-12-02 | Paper |
| Simple analyses of the sparse Johnson-Lindenstrauss transform | 2019-10-25 | Paper |
Optimal lower bounds for distributed and streaming spanning forest computation
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
| scientific article; zbMATH DE number 7075918 (Why is no real title available?) | 2019-07-03 | Paper |
New constructions of RIP matrices with fast multiplication and fewer rows
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
| Sparser Johnson-Lindenstrauss transforms | 2019-05-10 | Paper |
Sorting and selection with imprecise comparisons
ACM Transactions on Algorithms | 2018-10-30 | Paper |
The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction
(available as arXiv preprint) | 2017-12-19 | Paper |
Optimal Approximate Matrix Product in Terms of Stable Rank
(available as arXiv preprint) | 2017-12-19 | Paper |
An improved analysis of the ER-SpUD dictionary learning algorithm
(available as arXiv preprint) | 2017-12-19 | Paper |
| Optimality of the Johnson-Lindenstrauss Lemma | 2016-09-07 | Paper |
Toward a unified theory of sparse dimensionality reduction in Euclidean space
Geometric and Functional Analysis. GAFA | 2015-09-21 | Paper |
Toward a unified theory of sparse dimensionality reduction in Euclidean space
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Sparser Johnson-Lindenstrauss transforms
Journal of the ACM | 2014-09-12 | Paper |
Sparsity lower bounds for dimensionality reducing maps
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Lower bounds for oblivious subspace embeddings
Automata, Languages, and Programming | 2014-07-01 | Paper |
Fast moment estimation in data streams in optimal space
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
| On the exact space complexity of sketching and streaming small norms | 2014-05-22 | Paper |
On deterministic sketching and streaming for sparse recovery and norm estimation
Linear Algebra and its Applications | 2014-03-03 | Paper |
| OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings | 2012-11-05 | Paper |
On deterministic sketching and streaming for sparse recovery and norm estimation
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Almost Optimal Explicit Johnson-Lindenstrauss Families
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Almost Optimal Explicit Johnson-Lindenstrauss Families
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Sorting and selection with imprecise comparisons
Lecture Notes in Computer Science | 2009-07-14 | Paper |
Dynamic ham-sandwich cuts in the plane
Computational Geometry | 2009-06-18 | Paper |
