( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Node-Differentially Private Estimation of the Number of Connected Components.

, , , и . PODS, стр. 183-194. ACM, (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.

Sofya Raskhodnikova

 

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

The Price of Differential Privacy under Continual Observation., , , и . ICML, том 202 из Proceedings of Machine Learning Research, стр. 14654-14678. PMLR, (2023)Special Section on the Fifty-Eighth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017)., , и . SIAM J. Comput., (2020)Approximating the distance to monotonicity of Boolean functions., , и . Random Struct. Algorithms, 60 (2): 233-260 (2022)Property Testing with Online Adversaries., , , и . ITCS, том 287 из LIPIcs, стр. 11:1-11:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Isoperimetric Inequalities for Real-Valued Functions with Applications to Monotonicity Testing., , и . ICALP, том 261 из LIPIcs, стр. 25:1-25:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Node-Differentially Private Estimation of the Number of Connected Components., , , и . PODS, стр. 183-194. ACM, (2023)Isoperimetric Inequalities for Real-Valued Functions with Applications to Monotonicity Testing., , и . CoRR, (2020)Triangle Counting with Local Edge Differential Privacy., , , и . ICALP, том 261 из LIPIcs, стр. 52:1-52:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Sublinear-Time Computation in the Presence of Online Erasures., , и . ITCS, том 215 из LIPIcs, стр. 90:1-90:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Erasures vs. Errors in Local Decoding and Property Testing., , и . ITCS, том 124 из LIPIcs, стр. 63:1-63:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)