9 citations to https://www.mathnet.ru/rus/acm1
  1. Jacob Fox, Matthew Kwan, Hunter Spink, “Geometric and o-minimal Littlewood–Offord problems”, Ann. Probab., 51:1 (2023)  crossref
  2. Pandelis Dodos, Konstantinos Tyros, “Anticoncentration and Berry–Esseen bounds for random tensors”, Probab. Theory Relat. Fields, 187:1-2 (2023), 317  crossref
  3. Itay Glazer, Dan Mikulincer, “Anti-concentration of polynomials: Dimension-free covariance bounds and decay of Fourier coefficients”, Journal of Functional Analysis, 283:9 (2022), 109639  crossref
  4. Prahladh Harsha, Srikanth Srinivasan, “On polynomial approximations to AC”, Random Struct Algorithms, 54:2 (2019), 289  crossref
  5. Matthew Kwan, Benny Sudakov, Tuan Tran, “Anticoncentration for subgraph statistics”, J. London Math. Soc., 99:3 (2019), 757  crossref
  6. Ilias Diakonikolas, Daniel M. Kane, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019, 804  crossref
  7. Emanuele Viola, “Selected challenges in computational lower bounds”, SIGACT News, 48:1 (2017), 39  crossref
  8. Javad B. Ebrahimi, Damian Straszak, Nisheeth K. Vishnoi, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 2017, 1020  crossref
  9. Van Vu, A Journey Through Discrete Mathematics, 2017, 801  crossref