- Ronen Shaltiel, Emanuele Viola, Proceedings of the fortieth annual ACM symposium on Theory of computing, 2008, 589
- Scott Aaronson, Open Problems in Mathematics, 2016, 1
- Dylan M. McKay, Cody D. Murray, R. Ryan Williams, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019, 1215
- Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan, “A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates”, Algorithmica, 84, no. 4, 2022, 1132
- M. Alekhnovich, E. Ben-Sasson, A.A. Razborov, A. Wigderson, Proceedings 41st Annual Symposium on Foundations of Computer Science, 2000, 43
- Zeev Dvir, 2010 IEEE 25th Annual Conference on Computational Complexity, 2010, 291
- Russell Impagliazzo, Valentine Kabanets, Ilya Volkovich, “The Power of Natural Properties as Oracles”, comput. complex., 32, no. 2, 2023, 6
- Iftach Haitner, Omer Reingold, Salil Vadhan, “Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions”, SIAM J. Comput., 42, no. 3, 2013, 1405
- Alexander A. Razborov, 3142, Automata, Languages and Programming, 2004, 8
- Michael A. Forbes, Amir Shpilka, Ben Lee Volk, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017, 653