- Kei Uchizawa, Eiji Takimoto, “Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity”, Theoretical Computer Science, 407, no. 1-3, 2008, 474
- Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii, 8087, Mathematical Foundations of Computer Science 2013, 2013, 516
- Andrew Drucker, Fabian Kuhn, Rotem Oshman, Proceedings of the 2014 ACM symposium on Principles of distributed computing, 2014, 367
- G. LAPPAS, R. J. FRANK, A. A. ALBRECHT, “A COMPUTATIONAL STUDY ON CIRCUIT SIZE VERSUS CIRCUIT DEPTH”, Int. J. Artif. Intell. Tools, 15, no. 02, 2006, 143
- Anna Gál, Vladimir Trifonov, 4162, Mathematical Foundations of Computer Science 2006, 2006, 387
- Emanuele Viola, “Pseudorandom Bits for Constant‐Depth Circuits with Few Arbitrary Symmetric Gates”, SIAM J. Comput., 36, no. 5, 2007, 1387
- Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii, “Polynomial threshold functions and Boolean threshold circuits”, Information and Computation, 240, 2015, 56
- Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama, “Bounded depth circuits with weighted symmetric gates: Satisfiability, lower bounds and compression”, Journal of Computer and System Sciences, 105, 2019, 87
- Georgios Lappas, 4668, Artificial Neural Networks – ICANN 2007, 2007, 68
- Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Ashutosh Kumar, Xin Li, Raghu Meka, David Zuckerman, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, 1226