Follow
Navid Nouri
Navid Nouri
EPFL
Verified email at block-tech.io - Homepage
Title
Cited by
Cited by
Year
Graph spanners by sketching in dynamic streams and the simultaneous communication model
A Filtser, M Kapralov, N Nouri
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
262021
Fast and space efficient spectral sparsification in dynamic streams
M Kapralov, A Mousavifar, C Musco, C Musco, N Nouri, A Sidford, ...
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
262020
Kernel density estimation through density constrained near neighbor search
M Charikar, M Kapralov, N Nouri, P Siminelakis
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
232020
Dynamic streaming spectral sparsification in nearly linear time and space
M Kapralov, N Nouri, A Sidford, J Tardos
arXiv preprint arXiv:1903.12150, 2019
202019
Scaling up kernel ridge regression via locality sensitive hashing
A Zandieh, N Nouri, A Velingker, M Kapralov, I Razenshteyn
International Conference on Artificial Intelligence and Statistics, 4088-4097, 2020
17*2020
Age of information-reliability trade-offs in energy harvesting sensor networks
N Nouri, D Ardan, MM Feghhi
arXiv preprint arXiv:2008.00987, 2020
52020
Differentially private synthetic data using KD-trees
E Kreačić, N Nouri, VK Potluru, T Balch, M Veloso
Uncertainty in Artificial Intelligence, 1143-1153, 2023
42023
Faster spectral sparsification in dynamic streams
M Kapralov, A Mousavifar, C Musco, C Musco, N Nouri
arXiv preprint arXiv:1903.12165, 2019
42019
Efficient and local parallel random walks
M Kapralov, S Lattanzi, N Nouri, J Tardos
Advances in Neural Information Processing Systems 34, 21375-21387, 2021
32021
Sketches, metrics and fast algorithms
N Nouri
EPFL, 2022
2022
Differentially Private Synthetic Data Using KD-Trees (Supplementary Material)
E Kreacic, N Nouri, VK Potluru, T Balch, M Veloso
THL4
AH Chiplunkar, M Elias, GA Gluch, M Kapralov, A Kumar, M Makarov, ...
The system can't perform the operation now. Try again later.
Articles 1–12