- Dmitry Gavinsky, Or Meir, Omri Weinstein, Avi Wigderson, Proceedings of the forty-sixth annual ACM symposium on Theory of computing, 2014, 213
- Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener, “On converting CNF to DNF”, Theoretical Computer Science, 347, № 1-2, 2005, 325
- Olaf Beyersdorff, “On the correspondence between arithmetic theories and propositional proof systems – a survey”, Mathematical Logic Qtrly, 55, № 2, 2009, 116
- Meena Mahajan, Jayalal M. N. Sarma, “On the Complexity of Matrix Rank and Rigidity”, Theory Comput Syst, 46, № 1, 2010, 9
- Jiatu Li, Igor C. Oliveira, Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, 1051
- Shuichi Hirahara, “Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\)”, SIAM J. Comput., 52, № 6, 2023, FOCS18-349
- Lijie Chen, Ce Jin, Rahul Santhanam, R. Ryan Williams, 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2022, 646
- Quantum Computing since Democritus, 2013, 243
- Ryan C. Harkins, John M. Hitchcock, “Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds”, ACM Trans. Comput. Theory, 5, № 4, 2013, 1
- Emanuele Viola, “Guest Column”, SIGACT News, 40, № 1, 2009, 27