( en | de | ru )

 

Disambiguation of "Manurangsi, Pasin"

Author of the publication

copydeleteadd this publication to your clipboard
On Distributed Differential Privacy and Counting Distinct Elements.

, , , and . ITCS, volume 185 of LIPIcs, page 56:1-56:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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.

Walter Pasinato

Enrico Pasin

Marcia Pasin

Attila Pasinli

Samuele Pasini

 

Other publications of authors with the same name

Even 1×n Edge-Matching and Jigsaw Puzzles are Really Hard., , , , , and . CoRR, (2017)Almost-Polynomial Ratio ETH-Hardness of Approximating Densest k-Subgraph.. Electron. Colloquium Comput. Complex., (2016)Improved Lower Bound for Differentially Private Facility Location.. CoRR, (2024)The Price of Justified Representation., , , , , and . AAAI, page 4983-4990. AAAI Press, (2022)Deep Learning with Label Differential Privacy., , , , and . NeurIPS, page 27131-27145. (2021)Private Robust Estimation by Stabilizing Convex Relaxations., , and . COLT, volume 178 of Proceedings of Machine Learning Research, page 723-777. PMLR, (2022)Cryptographic Hardness of Learning Halfspaces with Massart Noise., , , and . NeurIPS, (2022)Nearly Optimal Robust Secret Sharing Against Rushing Adversaries., , and . CRYPTO (3), volume 12172 of Lecture Notes in Computer Science, page 156-185. Springer, (2020)Differentially Private Aggregation in the Shuffle Model: Almost Central Accuracy in Almost a Single Message., , , , and . ICML, volume 139 of Proceedings of Machine Learning Research, page 3692-3701. PMLR, (2021)A Note on Max k-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel and Improved Approximation.. SOSA, volume 69 of OASIcs, page 15:1-15:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)