| Extractor-based time-space lower bounds for learning S Garg, R Raz, A Tal Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 66 | 2018 |
| New security notions and feasibility results for authentication of quantum data S Garg, H Yuen, M Zhandry Advances in Cryptology–CRYPTO 2017: 37th Annual International Cryptology …, 2017 | 51 | 2017 |
| The role of randomness and noise in strategic classification M Braverman, S Garg arXiv preprint arXiv:2005.08377, 2020 | 50 | 2020 |
| Pseudorandom pseudo-distributions with near-optimal error for read-once branching programs M Braverman, G Cohen, S Garg SIAM Journal on Computing 49 (5), STOC18-242-STOC18-299, 2019 | 37* | 2019 |
| Time-space lower bounds for two-pass learning S Garg, R Raz, A Tal 34th Computational Complexity Conference (CCC), 2019 | 26 | 2019 |
| The coin problem with applications to data streams M Braverman, S Garg, DP Woodruff 2020 ieee 61st annual symposium on foundations of computer science (focs …, 2020 | 21 | 2020 |
| Memory-sample lower bounds for learning parity with noise S Garg, PK Kothari, P Liu, R Raz arXiv preprint arXiv:2107.02320, 2021 | 18 | 2021 |
| Tracking and improving information in the service of fairness S Garg, MP Kim, O Reingold Proceedings of the 2019 ACM Conference on Economics and Computation, 809-824, 2019 | 12 | 2019 |
| Oracle efficient online multicalibration and omniprediction S Garg, C Jung, O Reingold, A Roth Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 11 | 2024 |
| Tight space complexity of the coin problem M Braverman, S Garg, O Zamir 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 11 | 2022 |
| Coding in undirected graphs is either very helpful or not helpful at all M Braverman, S Garg, A Schvartzman 8th Innovations in Theoretical Computer Science Conference (ITCS 2017), 2017 | 11* | 2017 |
| The space complexity of mirror games S Garg, J Schneider arXiv preprint arXiv:1710.02898, 2017 | 10 | 2017 |
| Time-space tradeoffs for distinguishing distributions and applications to security of goldreich's PRG S Garg, PK Kothari, R Raz arXiv preprint arXiv:2002.07235, 2020 | 9 | 2020 |
| 8th Innovations in Theoretical Computer Science Conference (ITCS 2017) JR Lee, I Panageas, G Piliouras, Z Allen-Zhu, L Orecchia, T Kaufman, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2017 | 2 | 2017 |
| A New Information Complexity Measure for Multi-pass Streaming with Applications M Braverman, S Garg, Q Li, S Wang, DP Woodruff, J Zhang Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 1781-1792, 2024 | | 2024 |
| Implications of Space-bounded Computation S Garg Princeton University, 2020 | | 2020 |
Ran RazPrinceton University在 princeton.edu 的电子邮件经过验证
