• De A, Li H, Nadimpalli S and Servedio R. Detecting Low-Degree Truncation. Proceedings of the 56th Annual ACM Symposium on Theory of Computing. (1027-1038).

    https://doi.org/10.1145/3618260.3649633

  • Diakonikolas I, Kane D, Kontonis V, Liu S and Zarifis N. Efficient testable learning of halfspaces with adversarial label noise. Proceedings of the 37th International Conference on Neural Information Processing Systems. (39470-39490).

    /doi/10.5555/3666122.3667836

  • Diakonikolas I, Kane D and Ren L. Near-optimal cryptographic hardness of agnostically learning halfspaces and ReLU regression under Gaussian marginals. Proceedings of the 40th International Conference on Machine Learning. (7922-7938).

    /doi/10.5555/3618408.3618722

  • Gollakota A, Klivans A and Kothari P. A Moment-Matching Approach to Testable Learning and a New Characterization of Rademacher Complexity. Proceedings of the 55th Annual ACM Symposium on Theory of Computing. (1657-1670).

    https://doi.org/10.1145/3564246.3585206

  • Kelley Z and Meka R. Random restrictions and PRGs for PTFs in gaussian space. Proceedings of the 37th Computational Complexity Conference. (1-24).

    https://doi.org/10.4230/LIPIcs.CCC.2022.21

  • O’Donnell R, Servedio R and Tan L. (2022). Fooling Polytopes. Journal of the ACM. 69:2. (1-37). Online publication date: 30-Apr-2022.

    https://doi.org/10.1145/3460532

  • Diakonikolas I, Kane D and Zarifis N. Near-optimal SQ lower bounds for agnostically learning halfspaces and ReLUs under Gaussian marginals. Proceedings of the 34th International Conference on Neural Information Processing Systems. (13586-13596).

    /doi/10.5555/3495724.3496864

  • O'Donnell R, Servedio R and Tan L. Fooling Gaussian PTFs via local hyperconcentration. Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. (1170-1183).

    https://doi.org/10.1145/3357713.3384281

  • Boppana R, Håstad J, Lee C and Viola E. (2019). Bounded Independence versus Symmetric Tests. ACM Transactions on Computation Theory. 11:4. (1-27). Online publication date: 31-Dec-2020.

    https://doi.org/10.1145/3337783

  • Chattopadhyay E, De A and Servedio R. Simple and efficient pseudorandom generators from gaussian processes. Proceedings of the 34th Computational Complexity Conference. (1-33).

    https://doi.org/10.4230/LIPIcs.CCC.2019.4

  • O'Donnell R, Servedio R and Tan L. Fooling polytopes. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. (614-625).

    https://doi.org/10.1145/3313276.3316321

  • Kane D and Rao S. A PRG for boolean PTF of degree 2 with seed length subpolynomial in ϵ and logarithmic in n. Proceedings of the 33rd Computational Complexity Conference. (1-24).

    /doi/10.5555/3235586.3235588

  • Haramaty E, Lee C and Viola E. Bounded independence plus noise fools products. Proceedings of the 32nd Computational Complexity Conference. (1-30).

    /doi/10.5555/3135595.3135609

  • Kabanets V, Kane D and Lu Z. A polynomial restriction lemma with applications. Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. (615-628).

    https://doi.org/10.1145/3055399.3055470

  • Bogdanov A, Ishai Y, Viola E and źWilliamson C. Bounded Indistinguishability and the Complexity of Recovering Secrets. Proceedings, Part III, of the 36th Annual International Cryptology Conference on Advances in Cryptology --- CRYPTO 2016 - Volume 9816. (593-618).

    https://doi.org/10.1007/978-3-662-53015-3_21

  • Applebaum B, Bogdanov A and Rosen A. (2016). A Dichotomy for Local Small-Bias Generators. Journal of Cryptology. 29:3. (577-596). Online publication date: 1-Jul-2016.

    https://doi.org/10.1007/s00145-015-9202-8

  • Kane D. A polylogarithmic PRG for degree 2 threshold functions in the gaussian setting. Proceedings of the 30th Conference on Computational Complexity. (567-581).

    /doi/10.5555/2833227.2833255

  • Kothari P and Meka R. Almost Optimal Pseudorandom Generators for Spherical Caps. Proceedings of the forty-seventh annual ACM symposium on Theory of Computing. (247-256).

    https://doi.org/10.1145/2746539.2746611

  • Kane D and Meka R. A PRG for lipschitz functions of polynomials with applications to sparsest cut. Proceedings of the forty-fifth annual ACM symposium on Theory of Computing. (1-10).

    https://doi.org/10.1145/2488608.2488610

  • Harsha P, Klivans A and Meka R. (2013). An invariance principle for polytopes. Journal of the ACM. 59:6. (1-25). Online publication date: 1-Dec-2012.

    https://doi.org/10.1145/2395116.2395118

  • Applebaum B, Bogdanov A and Rosen A. A dichotomy for local small-bias generators. Proceedings of the 9th international conference on Theory of Cryptography. (600-617).

    https://doi.org/10.1007/978-3-642-28914-9_34

  • Huang Z, Wang L and Zhou Y. Black-box reductions in mechanism design. Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques. (254-265).

    /doi/10.5555/2033252.2033275

  • Kane D, Nelson J, Porat E and Woodruff D. Fast moment estimation in data streams in optimal space. Proceedings of the forty-third annual ACM symposium on Theory of computing. (745-754).

    https://doi.org/10.1145/1993636.1993735