- Emanuele Viola, “The communication complexity of addition”, Combinatorica, 35, no. 6, 2015, 703
- Daniel M. Kane, Ryan Williams, Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, 2016, 633
- Kazuyuki Amano, 12038, Language and Automata Theory and Applications, 2020, 235
- Matthias Krause, “Geometric arguments yield better bounds for threshold circuits and distributed computing”, Theoretical Computer Science, 156, no. 1-2, 1996, 99
- A. Beimel, E. Weinreb, 20th Annual IEEE Conference on Computational Complexity (CCC'05), 2005, 67
- Pravesh K. Kothari, Raghu Meka, Proceedings of the forty-seventh annual ACM symposium on Theory of Computing, 2015, 247
- Giancarlo Mauri, Alberto Leporati, 2747, Mathematical Foundations of Computer Science 2003, 2003, 92
- Vince Grolmusz, “On the power of circuits with gates of low L1 norms”, Theoretical Computer Science, 188, no. 1-2, 1997, 117
- Anindya De, Ilias Diakonikolas, Rocco A. Servedio, 2014 IEEE 29th Conference on Computational Complexity (CCC), 2014, 229
- Adam R. Klivans, Rocco A. Servedio, 3120, Learning Theory, 2004, 224