| Restricted isometry of Fourier matrices and list decodability of random linear codes M Cheraghchi, V Guruswami, A Velingker SIAM Journal on Computing 42 (5), 1888-1914, 2013 | 98 | 2013 |
| Random Fourier features for kernel ridge regression: Approximation bounds and statistical guarantees H Avron, M Kapralov, C Musco, C Musco, A Velingker, A Zandieh International Conference on Machine Learning, 253-262, 2017 | 67 | 2017 |
| Scalable and differentially private distributed aggregation in the shuffled model B Ghazi, R Pagh, A Velingker arXiv preprint arXiv:1906.08320, 2019 | 29 | 2019 |
| On the Power of Multiple Anonymous Messages. B Ghazi, N Golowich, R Kumar, R Pagh, A Velingker IACR Cryptol. ePrint Arch. 2019, 1382, 2019 | 19 | 2019 |
| A universal sampling method for reconstructing signals with simple fourier transforms H Avron, M Kapralov, C Musco, C Musco, A Velingker, A Zandieh Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 16 | 2019 |
| Oblivious sketching of high-degree polynomial kernels TD Ahle, M Kapralov, JBT Knudsen, R Pagh, A Velingker, DP Woodruff, ... Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 14 | 2020 |
| Bridging the capacity gap between interactive and one-way communication B Haeupler, A Velingker Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 14 | 2017 |
| An entropy sumset inequality and polynomially fast convergence to Shannon capacity over all alphabets V Guruswami, A Velingker arXiv preprint arXiv:1411.6993, 2014 | 14 | 2014 |
| Private aggregation from fewer anonymous messages B Ghazi, P Manurangsi, R Pagh, A Velingker Annual International Conference on the Theory and Applications of …, 2020 | 12 | 2020 |
| Pure differentially private summation from anonymous messages B Ghazi, N Golowich, R Kumar, P Manurangsi, R Pagh, A Velingker arXiv preprint arXiv:2002.01919, 2020 | 12 | 2020 |
| Dimension-independent sparse Fourier transform M Kapralov, A Velingker, A Zandieh Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 11 | 2019 |
| (1+ Ω (1))-Αpproximation to MAX-CUT Requires Linear Space M Kapralov, S Khanna, M Sudan, A Velingker Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 11 | 2017 |
| On the sensitivity conjecture for read-k formulas M Bafna, S Lokam, S Tavenas, A Velingker 41st International Symposium on Mathematical Foundations of Computer Science …, 2016 | 11 | 2016 |
| A fast algorithm for well-spaced points and approximate delaunay graphs GL Miller, DR Sheehy, A Velingker Proceedings of the twenty-ninth annual symposium on Computational geometry …, 2013 | 11 | 2013 |
| Communication with partial noiseless feedback B Haeupler, P Kamath, A Velingker Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2015 | 10 | 2015 |
| Approximating nearest neighbor distances MB Cohen, BT Fasy, GL Miller, A Nayyeri, DR Sheehy, A Velingker Workshop on Algorithms and Data Structures, 200-211, 2015 | 9 | 2015 |
| Shift lifts preserving Ramanujan property K Chandrasekaran, A Velingker Linear Algebra and its Applications 529, 199-214, 2017 | 4 | 2017 |
| Streaming complexity of approximating max 2csp and max acyclic subgraph V Guruswami, A Velingker, S Velusamy Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2017 | 4 | 2017 |
| Limitations on testable affine-invariant codes in the high-rate regime V Guruswami, M Sudan, A Velingker, C Wang Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 4 | 2014 |
| Towards constructing Ramanujan graphs using shift lifts K Chandrasekaran, A Velingker arXiv preprint arXiv:1502.07410, 2015 | 3 | 2015 |
