| 2022 | ICALP | Space Characterizations of Complexity Measures and Size-Space Trade-Offs in Propositional Proof Systems. | Theodoros Papamakarios, Alexander A. Razborov |
| 2020 | SAT | On CDCL-Based Proof Systems with the Ordered Decision Strategy. | Nathan Mull, Shuo Pang, Alexander A. Razborov |
| 2018 | STOC | Clique is hard on average for regular resolution. | Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordstrm, Alexander A. Razborov |
| 2014 | FOCS | On the AC0 Complexity of Subgraph Isomorphism. | Yuan Li, Alexander A. Razborov, Benjamin Rossman |
| 2011 | ICALP | Parameterized Bounded-Depth Frege Is Not Optimal. | Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov |
| 2011 | ICALP | On Minimal Unsatisfiability and Time-Space Trade-offs for | Jakob Nordstrm, Alexander A. Razborov |
| 2010 | CSR | Complexity of Propositional Proofs. | Alexander A. Razborov |
| 2009 | CSL | The Ackermann Award 2009. | Johann A. Makowsky, Alexander A. Razborov |
| 2008 | FOCS | The Sign-Rank of AC^O. | Alexander A. Razborov, Alexander A. Sherstov |
| 2008 | SODA | Almost Euclidean subspaces of l | Venkatesan Guruswami, James R. Lee, Alexander A. Razborov |
| 2006 | FOCS | An Omega(n | Alexander A. Razborov, Sergey Yekhanin |
| 2005 | CSL | The Ackermann Award 2005. | Erich Grdel, Janos Makowsky, Alexander A. Razborov |
| 2004 | ICALP | Feasible Proofs and Computations: Partnership and Fusion. | Alexander A. Razborov |
| 2004 | LICS | Feasible Proofs and Computations: Partnership and Fusion. | Alexander A. Razborov |
| 2002 | FOCS | Satisfiability, Branch-Width and Tseitin Tautologies. | Michael Alekhnovich, Alexander A. Razborov |
| 2001 | DLT | Proof Complexity of Pigeonhole Principles. | Alexander A. Razborov |
| 2001 | FOCS | Lower Bounds for Polynomial Calculus: Non-Binomial Case. | Michael Alekhnovich, Alexander A. Razborov |
| 2001 | FOCS | Resolution is Not Automatizable Unless W[P] is Tractable. | Michael Alekhnovich, Alexander A. Razborov |
| 2000 | FOCS | Pseudorandom Generators in Propositional Proof Complexity. | Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson |
| 2000 | STOC | Space complexity in propositional calculus. | Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson |
| 1998 | FOCS | Exponential Complexity Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions Over Finite Fields. | Dima Grigoriev, Alexander A. Razborov |
| 1997 | MFCS | On O versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs. | Stasys Jukna, Alexander A. Razborov, Petr Savick, Ingo Wegener |
| 1997 | STOC | Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus. | Alexander A. Razborov, Avi Wigderson, Andrew Chi-Chih Yao |
| 1996 | ICALP | Lower Bounds for Propositional Proofs and Independence Results in Bounded Arithmetic. | Alexander A. Razborov |
| 1995 | MFCS | Lower Bounds for Propositional Proofs and Independence Results in Bounded Arithmetic (Abstract). | Alexander A. Razborov |
| 1994 | STOC | Natural proofs. | Alexander A. Razborov, Steven Rudich |
| 1991 | FCT | Lower Bounds for Deterministic and Nondeterministic Branching Programs. | Alexander A. Razborov |
| 1990 | ICALP | On the Distributional Complexity of Disjontness. | Alexander A. Razborov |
| 1989 | STOC | On the Method of Approximations | Alexander A. Razborov |