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 | 104 | 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 | 95 | 2017 |

Scalable and differentially private distributed aggregation in the shuffled model B Ghazi, R Pagh, A Velingker arXiv preprint arXiv:1906.08320, 2019 | 43 | 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 | 35 | 2020 |

On the power of multiple anonymous messages B Ghazi, N Golowich, R Kumar, R Pagh, A Velingker arXiv preprint arXiv:1908.11358, 2019 | 29 | 2019 |

Private aggregation from fewer anonymous messages B Ghazi, P Manurangsi, R Pagh, A Velingker Advances in Cryptology–EUROCRYPT 2020 12106, 798, 2020 | 24 | 2020 |

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 | 21 | 2019 |

Dimension-independent sparse fourier transform M Kapralov, A Velingker, A Zandieh Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 20 | 2019 |

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 | 19 | 2020 |

(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 | 19 | 2017 |

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 | 15 | 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 |

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 | 13 | 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 | 12 | 2013 |

Communication with partial noiseless feedback B Haeupler, P Kamath, A Velingker Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2015 | 11 | 2015 |

Streaming complexity of approximating max 2csp and max acyclic subgraph V Guruswami, A Velingker, S Velusamy Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2017 | 10 | 2017 |

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 |

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 | 5 | 2020 |

Shift lifts preserving Ramanujan property K Chandrasekaran, A Velingker Linear Algebra and its Applications 529, 199-214, 2017 | 5 | 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 |