( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Role of Randomness and Noise in Strategic Classification.

, и . FORC, том 156 из LIPIcs, стр. 9:1-9:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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.

Neil Garg

Animesh Garg

Priya Garg

Dineshkumar Garg

Martin Garg

 

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

The Space Complexity of Mirror Games., и . ITCS, том 124 из LIPIcs, стр. 36:1-36:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)The Role of Randomness and Noise in Strategic Classification., и . FORC, том 156 из LIPIcs, стр. 9:1-9:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Extractor-Based Time-Space Lower Bounds for Learning., , и . CoRR, (2017)Tracking and Improving Information in the Service of Fairness., , и . EC, стр. 809-824. ACM, (2019)Time-Space Lower Bounds for Two-Pass Learning., , и . CCC, том 137 из LIPIcs, стр. 22:1-22:39. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Time-Space Tradeoffs for Distinguishing Distributions and Applications to Security of Goldreich's PRG., , и . APPROX-RANDOM, том 176 из LIPIcs, стр. 21:1-21:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Memory-Sample Lower Bounds for Learning Parity with Noise., , , и . APPROX-RANDOM, том 207 из LIPIcs, стр. 60:1-60:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Implications of Space-Bounded Computation. Princeton University, USA, (2020)New Security Notions and Feasibility Results for Authentication of Quantum Data., , и . CRYPTO (2), том 10402 из Lecture Notes in Computer Science, стр. 342-371. Springer, (2017)Hitting sets with near-optimal error for read-once branching programs., , и . STOC, стр. 353-362. ACM, (2018)