- Alexander (Sasha) Razborov, “Eulogy: Michael (Misha) Alekhnovich 1978-2006”, SIGACT News, 38, № 1, 2007, 70
- Guy N. Rothblum, Salil Vadhan, Avi Wigderson, Proceedings of the forty-fifth annual ACM symposium on Theory of Computing, 2013, 793
- Alexander Razborov, “Guest Column”, SIGACT News, 47, № 2, 2016, 66
- Iddo Tzameret, “Algebraic proofs over noncommutative formulas”, Information and Computation, 209, № 10, 2011, 1269
- Ran Raz, Proceedings of the fortieth annual ACM symposium on Theory of computing, 2008, 711
- Jan Pich, Rahul Santhanam, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019, 1305
- Benny Applebaum, Andrej Bogdanov, Alon Rosen, 7194, Theory of Cryptography, 2012, 600
- Michael Alekhnovich, Alexander A. Razborov, “Resolution Is Not Automatizable Unless W[P] Is Tractable”, SIAM J. Comput., 38, № 4, 2008, 1347
- Arist Kojevnikov, Alexander S. Kulikov, 4121, Theory and Applications of Satisfiability Testing - SAT 2006, 2006, 11
- Alexander Razborov, “On the Width of Semialgebraic Proofs and Algorithms”, Mathematics of OR, 42, № 4, 2017, 1106