| Publication | Date of Publication | Type |
|---|
| 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 |
| https://portal.mardi4nfdi.de/entity/Q6126334 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147352 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147368 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147369 | 2024-01-15 | Paper |
| Towards tight bounds for spectral sparsification of hypergraphs | 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 | 2022-07-18 | Paper |
| Fast and Space Efficient Spectral Sparsification in Dynamic Streams | 2021-02-02 | Paper |
| Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples | 2021-02-02 | Paper |
| Oblivious Sketching of High-Degree Polynomial Kernels | 2021-02-02 | Paper |
| Differentially Private Release of Synthetic Graphs | 2021-02-02 | Paper |
| A universal sampling method for reconstructing signals with simple Fourier transforms | 2020-01-30 | Paper |
| An optimal space lower bound for approximating MAX-CUT | 2020-01-30 | Paper |
| Dimension-independent sparse Fourier transform | 2019-10-15 | Paper |
| Perfect matchings in \(\tilde{O}(n^{1.5})\) time in regular bipartite graphs | 2019-09-04 | Paper |
| (Nearly) sample-optimal sparse Fourier transform | 2019-06-20 | Paper |
| Approximating matching size from random streams | 2019-06-20 | Paper |
| On differentially private low rank approximation | 2019-05-15 | Paper |
| Better bounds for matchings in the streaming model | 2019-05-15 | Paper |
| Online submodular welfare maximization: greedy is optimal | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743414 | 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 | 2018-07-16 | Paper |
| Streaming Lower Bounds for Approximating MAX-CUT | 2017-10-05 | Paper |
| Sparse Fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time | 2017-09-29 | Paper |
| An adaptive sublinear-time block sparse Fourier transform | 2017-08-17 | Paper |
| Single pass spectral sparsification in dynamic streams | 2017-03-10 | Paper |
| Spectral sparsification via random spanners | 2016-10-07 | Paper |
| Spanners and sparsifiers in dynamic streams | 2015-09-03 | Paper |
| Perfect matchings via uniform sampling in regular bipartite graphs | 2014-11-18 | Paper |
| Perfect matchings in \(O(n \log n)\) time in regular bipartite graphs | 2014-08-13 | Paper |
| Perfect matchings in \(O(n\log n)\) time in regular bipartite graphs | 2013-09-25 | Paper |
| NNS lower bounds via metric expansion for \(l _{ \infty }\) and EMD | 2013-08-12 | Paper |
| Embedding paths into trees: VM placement to minimize congestion | 2012-09-25 | Paper |
| Multiplicative Approximations of Random Walk Transition Probabilities | 2011-08-17 | Paper |
| Improved Bounds for Online Stochastic Matching | 2010-09-06 | Paper |
