- R. Beigel, A. Maciel, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference, 1997, 149
- László Babai, Anna Gál, Peter G. Kimmel, Satyanarayana V. Lokam, “Communication Complexity of Simultaneous Messages”, SIAM J. Comput., 33, no. 1, 2003, 137
- Vladimir V. Podolskii, Alexander A. Sherstov, “Inner Product and Set Disjointness”, ACM Trans. Comput. Theory, 12, no. 4, 2020, 1
- Xiaoming Sun, Yuan Sun, Kewen Wu, Zhiyu Xia, “On the relationship between energy complexity and other boolean function measures”, J Comb Optim, 43, no. 5, 2022, 1470
- Giancarlo Mauri, Alberto Leporati, 2747, Mathematical Foundations of Computer Science 2003, 2003, 92
- Emanuele Viola, Avi Wigderson, “One-way multiparty communication lower bound for pointer jumping with applications”, Combinatorica, 29, no. 6, 2009, 719
- Paul Beame, Trinh Huynh, “Multiparty Communication Complexity and Threshold Circuit Size of $\ensuremathAC^0$”, SIAM J. Comput., 41, no. 3, 2012, 484
- Richard Beigel, Alexis Maciel, “Upper and lower bounds for some depth-3 circuit classes”, Comput Complexity, 6, no. 3, 1996, 235
- Emanuele Viola, “Guest Column”, SIGACT News, 40, no. 1, 2009, 27
- Emanuele Viola, Avi Wigderson, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 2007, 427