( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Separating Computational and Statistical Differential Privacy (Under Plausible Assumptions).

, , , , и . CoRR, (2023)

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.

Tina Badihian

Hasnain Ghazi

Badih Kareh

Ghazi Chehab

Anver Ghazi

 

Другие публикации лиц с тем же именем

The Information Complexity of Hamming Distance., , и . APPROX-RANDOM, том 28 из LIPIcs, стр. 465-489. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Differentially Private Aggregation in the Shuffle Model: Almost Central Accuracy in Almost a Single Message., , , , и . ICML, том 139 из Proceedings of Machine Learning Research, стр. 3692-3701. PMLR, (2021)Communication Complexity of Permutation-Invariant Functions., , и . SODA, стр. 1902-1921. SIAM, (2016)Decidability of Non-interactive Simulation of Joint Distributions., , и . FOCS, стр. 545-554. IEEE Computer Society, (2016)Differentially Private Ad Conversion Measurement., , , , , , , , и . CoRR, (2024)Dimension Reduction for Polynomials over Gaussian Space and Applications., , и . CoRR, (2017)Deep Learning with Label Differential Privacy., , , , и . NeurIPS, стр. 27131-27145. (2021)Crosslingual Capabilities and Knowledge Barriers in Multilingual Large Language Models., , , , , , , , и . CoRR, (2024)Algorithms with More Granular Differential Privacy Guarantees., , , и . ITCS, том 251 из LIPIcs, стр. 54:1-54:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Communication-Rounds Tradeoffs for Common Randomness and Secret Key Generation., , , и . SODA, стр. 1861-1871. SIAM, (2019)