| Publication | Date of Publication | Type |
|---|
Quasi-optimal hierarchically semi-separable matrix approximation
SIAM Journal on Matrix Analysis and Applications | 2026-06-12 | Paper |
Fixed-sparsity matrix approximation from matrix-vector products
SIAM Journal on Matrix Analysis and Applications | 2026-05-08 | Paper |
| Simple heuristics yield provable algorithms for masked low-rank approximation | 2026-04-15 | Paper |
| Universal matrix sparsifiers and fast deterministic algorithms for linear algebra | 2025-11-04 | Paper |
| Active linear regression for _p norms and beyond | 2025-08-15 | Paper |
| Near optimal linear algebra in the online and sliding window models | 2025-08-12 | Paper |
| Sublinear time low-rank approximation of positive semidefinite matrices | 2025-08-06 | Paper |
| Single pass spectral sparsification in dynamic streams | 2025-08-05 | Paper |
| Non-adaptive edge counting and sampling via bipartite independent set queries | 2025-06-19 | Paper |
| Subspace embeddings under nonlinear transformations | 2025-02-11 | Paper |
| Intervention efficient algorithms for approximate learning of causal graphs | 2025-02-11 | Paper |
| On the unreasonable effectiveness of single vector Krylov methods for low-rank approximation | 2024-11-28 | Paper |
| Sublinear time low-rank approximation of Toeplitz matrices | 2024-11-28 | Paper |
| Sublinear time eigenvalue approximation via random sampling | 2024-11-14 | Paper |
| Near-linear sample complexity for L_p polynomial regression | 2024-05-14 | Paper |
| Spiking neural networks through the lens of streaming algorithms | 2023-11-02 | Paper |
A basic compositional model for spiking neural networks
Lecture Notes in Computer Science | 2023-07-26 | Paper |
Low-Memory Krylov Subspace Methods for Optimal Rational Matrix Function Approximation
SIAM Journal on Matrix Analysis and Applications | 2023-05-31 | Paper |
| Near-Optimal Approximation of Matrix Functions by the Lanczos Method | 2023-03-06 | Paper |
| Neuro-RAM unit with applications to similarity testing and compression in spiking neural networks | 2023-02-03 | Paper |
| Random Sketching, Clustering, and Short-Term Memory in Spiking Neural Networks. | 2023-02-03 | Paper |
| Toeplitz Low-Rank Approximation with Sublinear Query Complexity | 2022-11-21 | Paper |
Error Bounds for Lanczos-Based Matrix Function Approximation
SIAM Journal on Matrix Analysis and Applications | 2022-06-03 | Paper |
| Sublinear Time Eigenvalue Approximation via Random Sampling | 2021-09-15 | Paper |
Eigenvector Computation and Community Detection in Asynchronous Gossip Models
(available as arXiv preprint) | 2021-07-28 | Paper |
Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness
(available as arXiv preprint) | 2021-06-15 | Paper |
Online row sampling
Theory of Computing | 2021-04-01 | 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 |
Sample Efficient Toeplitz Covariance Estimation
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
| Hutch++: Optimal Stochastic Trace Estimation | 2020-10-19 | Paper |
| Fourier Sparse Leverage Scores and Approximate Kernel Learning | 2020-06-12 | 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 |
Ant-inspired density estimation via random walks
Proceedings of the National Academy of Sciences | 2019-01-11 | Paper |
Input sparsity time low-rank approximation via ridge leverage score sampling
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Computational tradeoffs in biological neural networks: self-stabilizing winner-take-all networks
(available as arXiv preprint) | 2018-05-03 | Paper |
Online row sampling
(available as arXiv preprint) | 2018-04-19 | Paper |
| Stability of the Lanczos method for matrix function approximation | 2018-03-15 | Paper |
Stability of the Lanczos method for matrix function approximation
(available as arXiv preprint) | 2018-03-15 | Paper |
Ant-Inspired Density Estimation via Random Walks
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Uniform sampling for matrix approximation
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
Distributed house-hunting in ant colonies
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Dimensionality reduction for k-means clustering and low rank approximation
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
