Author of the publication

Private Aggregation from Fewer Anonymous Messages.

, , , and . EUROCRYPT (2), volume 12106 of Lecture Notes in Computer Science, page 798-827. Springer, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Velingker, Ameya
add a person with the name Velingker, Ameya
 

Other publications of authors with the same name

Private Robust Estimation by Stabilizing Convex Relaxations., , and . COLT, volume 178 of Proceedings of Machine Learning Research, page 723-777. PMLR, (2022)A fast algorithm for well-spaced points and approximate delaunay graphs., , and . SoCG, page 289-298. ACM, (2013)Exphormer: Sparse Transformers for Graphs., , , , and . ICML, volume 202 of Proceedings of Machine Learning Research, page 31613-31632. PMLR, (2023)Efficient Location Sampling Algorithms for Road Networks., , , , , and . WWW (Companion Volume), page 899-902. ACM, (2024)Private Aggregation from Fewer Anonymous Messages., , , and . EUROCRYPT (2), volume 12106 of Lecture Notes in Computer Science, page 798-827. Springer, (2020)On the Power of Multiple Anonymous Messages: Frequency Estimation and Selection in the Shuffle Model of Differential Privacy., , , , and . EUROCRYPT (3), volume 12698 of Lecture Notes in Computer Science, page 463-488. Springer, (2021)Linear Space Streaming Lower Bounds for Approximating CSPs., , , , and . CoRR, (2021)Oblivious Sketching of High-Degree Polynomial Kernels., , , , , , and . SODA, page 141-160. SIAM, (2020)(1 + Ω(1))-Αpproximation to MAX-CUT Requires Linear Space., , , and . SODA, page 1703-1722. SIAM, (2017)Linear space streaming lower bounds for approximating CSPs., , , , and . STOC, page 275-288. ACM, (2022)