- Ronen Shaltiel, Emanuele Viola, “Hardness Amplification Proofs Require Majority”, SIAM J. Comput., 39, no. 7, 2010, 3122
- Emanuele Viola, “Selected challenges in computational lower bounds”, SIGACT News, 48, no. 1, 2017, 39
- Xiaoming Sun, Yuan Sun, Kewen Wu, Zhiyu Xia, 11653, Computing and Combinatorics, 2019, 516
- Vince Grolmusz, “Constructing set systems with prescribed intersection sizes”, Journal of Algorithms, 44, no. 2, 2002, 321
- D. Grigoriev, A.A. Razborov, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), 1998, 269
- Paul Beame, Dang-Trinh Huynh-Ngoc, 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 2009, 53
- Pooya Hatami, William M. Hoza, Avishay Tal, Roei Tell, Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, 895
- Alexander A. Sherstov, “The Multiparty Communication Complexity of Set Disjointness”, SIAM J. Comput., 45, no. 4, 2016, 1450
- N. Alon, R. Beigel, Proceedings 16th Annual IEEE Conference on Computational Complexity, 2000, 184
- Kei UCHIZAWA, “Lower Bounds for Threshold Circuits of Bounded Energy”, IIS, 20, no. 1, 2014, 27