Ameya Velingker
Ameya Velingker
Collaborateur Scientifique (Research Scientist)
Verified email at epfl.ch - Homepage
Title
Cited by
Cited by
Year
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
912013
Random Fourier features for kernel ridge regression: Approximation bounds and statistical guarantees
H Avron, M Kapralov, C Musco, C Musco, A Velingker, A Zandieh
Proceedings of the 34th International Conference on Machine Learning-Volume …, 2017
432017
Scalable and differentially private distributed aggregation in the shuffled model
B Ghazi, R Pagh, A Velingker
arXiv preprint arXiv:1906.08320, 2019
142019
An entropy sumset inequality and polynomially fast convergence to Shannon capacity over all alphabets
V Guruswami, A Velingker
arXiv preprint arXiv:1411.6993, 2014
132014
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
112017
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
102019
On the sensitivity conjecture for read-k formulas
M Bafna, SV Lokam, S Tavenas, A Velingker
41st International Symposium on Mathematical Foundations of Computer Science …, 2016
102016
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
102013
(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
92017
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
82015
Communication with partial noiseless feedback
B Haeupler, P Kamath, A Velingker
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2015
72015
Dimension-independent sparse Fourier transform
M Kapralov, A Velingker, A Zandieh
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
62019
On the power of multiple anonymous messages
B Ghazi, N Golowich, R Kumar, R Pagh, A Velingker
arXiv preprint arXiv:1908.11358, 2019
52019
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
42020
Private aggregation from fewer anonymous messages
B Ghazi, P Manurangsi, R Pagh, A Velingker
Annual International Conference on the Theory and Applications of …, 2020
32020
Shift lifts preserving Ramanujan property
K Chandrasekaran, A Velingker
Linear Algebra and its Applications 529, 199-214, 2017
32017
Streaming complexity of approximating max 2csp and max acyclic subgraph
V Guruswami, A Velingker, S Velusamy
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2017
32017
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
32014
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
22020
Oblivious sketching of high-degree polynomial kernels
M Kapralov, R Pagh, A Velingker, D Woodruff, A Zandieh
arXiv preprint arXiv:1909.01410, 2019
22019
The system can't perform the operation now. Try again later.
Articles 1–20