- Alexander A. Sherstov, “Breaking the Minsky–Papert Barrier for Constant-Depth Circuits”, SIAM J. Comput., 47, no. 5, 2018, 1809
- Mark Bun, Robin Kothari, Justin Thaler, “Quantum algorithms and approximating polynomials for composed functions with shared inputs”, Quantum, 5, 2021, 543
- Alexander A. Sherstov, “Algorithmic Polynomials”, SIAM J. Comput., 49, no. 6, 2020, 1173
- Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii, “Polynomial threshold functions and Boolean threshold circuits”, Information and Computation, 240, 2015, 56
- Alexander A. Sherstov, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 2015, 431
- Mika Goos, Toniann Pitassi, Thomas Watson, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 2017, 132
- Kei Uchizawa, Haruki Abe, “Trade-Offs Between Energy and Depth of Neural Networks”, Neural Computation, 36, no. 8, 2024, 1541