1

Private Aggregation from Fewer Anonymous Messages
Badih Ghazi, Pasin Manurangsi, Rasmus Pagh, Ameya Velingker
उद्धृत करें arXiv URL
Oblivious Sketching of High-Degree Polynomial Kernels
Thomas D. Ahle, Michael Kapralov, Jakob Bæk Tejs Knudsen, Rasmus Pagh, Ameya Velingker, David P. Woodruff, Amir Zandieh
उद्धृत करें arXiv URL
A Universal Sampling Method for Reconstructing Signals with Simple Fourier Transforms
Haim Avron, Michael Kapralov, Cameron Musco, Christopher Musco, Ameya Velingker, Amir Zandieh
उद्धृत करें arXiv URL
Dimension-independent Sparse Fourier Transform
Michael Kapralov, Ameya Velingker, Amir Zandieh
उद्धृत करें arXiv URL
Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph
Venkatesan Guruswami, Ameya Velingker, Santhoshini Velusamy
उद्धृत करें URL
Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guarantees
Haim Avron, Michael Kapralov, Cameron Musco, Christopher Musco, Ameya Velingker, Amir Zandieh
उद्धृत करें arXiv URL
(1 + Ω(1))-Αpproximation to MAX-CUT Requires Linear Space
Michael Kapralov, Sanjeev Khanna, Madhu Sudan, Ameya Velingker
उद्धृत करें URL
Bridging the Capacity Gap Between Interactive and One-Way Communication
Bernhard Haeupler, Ameya Velingker
उद्धृत करें arXiv ECCC URL
On the Sensitivity Conjecture for Read-k Formulas
Mitali Bafna, Satyanarayana V. Lokam, Sébastien Tavenas, Ameya Velingker
उद्धृत करें ECCC URL
Communication with Partial Noiseless Feedback
Bernhard Haeupler, Pritish Kamath, Ameya Velingker
उद्धृत करें URL