| Publication | Date of Publication | Type |
|---|
| Streaming algorithms for connectivity augmentation | 2026-01-14 | Paper |
| On the streaming complexity of expander decomposition | 2026-01-14 | Paper |
| On constructing spanners from random Gaussian projections | 2025-01-14 | Paper |
| A quasi-Monte Carlo data structure for smooth kernel evaluations | 2024-11-28 | Paper |
| Expander decomposition in dynamic streams | 2024-09-25 | Paper |
| Simulating random walks in random streams | 2024-07-19 | Paper |
| Learning hierarchical cluster structure of graphs in sublinear time | 2024-05-14 | Paper |
| Traversing the FFT computation tree for dimension-independent sparse Fourier transforms | 2024-05-14 | Paper |
| Communication efficient coresets for maximum matching | 2024-05-14 | Paper |
scientific article; zbMATH DE number 7829323 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
scientific article; zbMATH DE number 7788435 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
scientific article; zbMATH DE number 7788450 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
scientific article; zbMATH DE number 7788451 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Towards tight bounds for spectral sparsification of hypergraphs
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
| Toeplitz Low-Rank Approximation with Sublinear Query Complexity | 2022-11-21 | Paper |
A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling
(available as arXiv preprint) | 2022-07-18 | Paper |
Fast and Space Efficient Spectral Sparsification in Dynamic Streams
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Oblivious Sketching of High-Degree Polynomial Kernels
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Differentially Private Release of Synthetic Graphs
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
A universal sampling method for reconstructing signals with simple Fourier transforms
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
An optimal space lower bound for approximating MAX-CUT
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Dimension-independent sparse Fourier transform
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Perfect matchings in \(\tilde{O}(n^{1.5})\) time in regular bipartite graphs
Combinatorica | 2019-09-04 | Paper |
(Nearly) sample-optimal sparse Fourier transform
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Approximating matching size from random streams
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
On differentially private low rank approximation
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Better bounds for matchings in the streaming model
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Online submodular welfare maximization: greedy is optimal
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| scientific article; zbMATH DE number 7053293 (Why is no real title available?) | 2019-05-10 | Paper |
| Perfect matchings via uniform sampling in regular bipartite graphs | 2019-05-06 | Paper |
\((1 + \Omega(1))\)-approximation to MAX-CUT requires linear space
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Streaming Lower Bounds for Approximating MAX-CUT
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Sparse Fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
An adaptive sublinear-time block sparse Fourier transform
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Single pass spectral sparsification in dynamic streams
SIAM Journal on Computing | 2017-03-10 | Paper |
Spectral sparsification via random spanners
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
Spanners and sparsifiers in dynamic streams
Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
Perfect matchings via uniform sampling in regular bipartite graphs
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Perfect matchings in \(O(n \log n)\) time in regular bipartite graphs
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Perfect matchings in \(O(n\log n)\) time in regular bipartite graphs
SIAM Journal on Computing | 2013-09-25 | Paper |
NNS lower bounds via metric expansion for \(l _{ \infty }\) and EMD
Automata, Languages, and Programming | 2013-08-12 | Paper |
Embedding paths into trees: VM placement to minimize congestion
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Multiplicative Approximations of Random Walk Transition Probabilities
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Improved Bounds for Online Stochastic Matching
Algorithms – ESA 2010 | 2010-09-06 | Paper |
