On the Method of Approximations - Alexander A. Razborov (STOC, 1989)

On the Distributional Complexity of Disjontness. - Alexander A. Razborov (ICALP, 1990)

Applications of matrix methods to the theory of lower bounds in computational complexity. - Alexander A. Razborov (Comb., 1990)

Lower Bounds for Deterministic and Nondeterministic Branching Programs. - Alexander A. Razborov (FCT, 1991)

The Set of Minimal Braids is co-NP-Complete. - Mike Paterson; Alexander A. Razborov (J. Algorithms, 1991)

On Small Depth Threshold Circuits. - Alexander A. Razborov (SWAT, 1992)

Majority Gates VS. General Weighted Threshold Gates. - Mikael Goldmann; Johan Håstad; Alexander A. Razborov (Comput. Complex., 1992)

The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear. - Alexander A. Razborov (Discret. Math., 1992)

On the Distributional Complexity of Disjointness. - Alexander A. Razborov (Theor. Comput. Sci., 1992)

On Lower Bounds for Read-K-Times Branching Programs. - Allan Borodin; Alexander A. Razborov; Roman Smolensky (Comput. Complex., 1993)

Constructing Small Sets that are Uniform in Arithmetic Progressions. - Alexander A. Razborov; Endre Szemerédi; Avi Wigderson (Comb. Probab. Comput., 1993)

On the Parameterization of solutions for equations in Free Groups. - Alexander A. Razborov (Int. J. Algebra Comput., 1993)

n^Omega(log n) Lower Bounds on the Size of Depth-3 Threshold Circuits with AND Gates at the Bottom. - Alexander A. Razborov; Avi Wigderson (Inf. Process. Lett., 1993)

On provably disjoint NP-pairs - Alexander A. Razborov (Electron. Colloquium Comput. Complex., 1994)

Lower Bounds for Propositional Proofs and Independence Results in Bounded Arithmetic (Abstract). - Alexander A. Razborov (MFCS, 1995)

On the Shrinkage Exponent for Read-Once Formulae. - Johan Håstad; Alexander A. Razborov; Andrew Chi-Chih Yao (Theor. Comput. Sci., 1995)

Lower Bounds for Propositional Proofs and Independence Results in Bounded Arithmetic. - Alexander A. Razborov (ICALP, 1996)

The future of computational complexity theory: part I. - Christos H. Papadimitriou; Oded Goldreich 001; Avi Wigderson; Alexander A. Razborov; Michael Sipser (SIGACT News, 1996)

On O versus NP cap co-NP for Decision Trees and Read-Once Branching Programs. - Stasys Jukna; Alexander A. Razborov; Petr Savický; Ingo Wegener (MFCS, 1997)

Proof Complexity in Algebraic Systems and Bounded Depth Frege Systems with Modular Counting. - Samuel R. Buss; Russell Impagliazzo; Jan Krajícek; Pavel Pudlák; Alexander A. Razborov; Jirí Sgall (Comput. Complex., 1997)

Natural Proofs. - Alexander A. Razborov; Steven Rudich (J. Comput. Syst. Sci., 1997)

Exponential Complexity Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions Over Finite Fields. - Dima Grigoriev; Alexander A. Razborov (FOCS, 1998)

Lower Bounds for the Polynomial Calculus. - Alexander A. Razborov (Comput. Complex., 1998)

Neither Reading Few Bits Twice Nor Reading Illegally Helps Much. - Stasys Jukna; Alexander A. Razborov (Discret. Appl. Math., 1998)

On P versus NP cap co-NP for decision trees and read-once branching programs. - Stasys Jukna; Alexander A. Razborov; Petr Savický; Ingo Wegener (Comput. Complex., 1999)

One Property of Cross-Intersecting Families - Alexander A. Razborov; Nikolai K. Vereshchagin (Electron. Colloquium Comput. Complex., 1999)

Exponential Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions over Finite Fields. - Dima Grigoriev; Alexander A. Razborov (Appl. Algebra Eng. Commun. Comput., 2000)

Proof Complexity of Pigeonhole Principles. - Alexander A. Razborov (Developments in Language Theory, 2001)

Lower Bounds for Polynomial Calculus: Non-Binomial Case. - Michael Alekhnovich; Alexander A. Razborov (FOCS, 2001)

Improved Resolution Lower Bounds for the Weak Pigeonhole Principle - Alexander A. Razborov (Electron. Colloquium Comput. Complex., 2001)

Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus. - Alexander A. Razborov; Avi Wigderson; Andrew Chi-Chih Yao (Comb., 2002)

Space Complexity in Propositional Calculus. - Michael Alekhnovich; Eli Ben-Sasson; Alexander A. Razborov; Avi Wigderson (SIAM J. Comput., 2002)

Propositional proof complexity. - Alexander A. Razborov (J. ACM, 2003)

Resolution lower bounds for the weak functional pigeonhole principle. - Alexander A. Razborov (Theor. Comput. Sci., 2003)

Feasible Proofs and Computations: Partnership and Fusion. - Alexander A. Razborov (LICS, 2004)

Resolution lower bounds for perfect matching principles. - Alexander A. Razborov (J. Comput. Syst. Sci., 2004)

An upper bound on the threshold quantum decoherence rate. - Alexander A. Razborov (Quantum Inf. Comput., 2004)

Pseudorandom Generators in Propositional Proof Complexity. - Michael Alekhnovich; Eli Ben-Sasson; Alexander A. Razborov; Avi Wigderson (SIAM J. Comput., 2004)

The Ackermann Award 2005. - Erich Grädel; Janos Makowsky; Alexander A. Razborov (CSL, 2005)

Guessing More Secrets via List Decoding. - Alexander A. Razborov (Internet Math., 2005)

An Omega(n1/3) Lower Bound for Bilinear Group Based Private Information Retrieval. - Alexander A. Razborov; Sergey Yekhanin (Electron. Colloquium Comput. Complex., 2006)

Why are there so many loop formulas? - Vladimir Lifschitz; Alexander A. Razborov (ACM Trans. Comput. Log., 2006)

Almost Euclidean subspaces of ℓ1N via expander codes. - Venkatesan Guruswami; James R. Lee; Alexander A. Razborov (Electron. Colloquium Comput. Complex., 2007)

Flag algebras. - Alexander A. Razborov (J. Symb. Log., 2007)

Eulogy: Michael (Misha) Alekhnovich 1978-2006. - Alexander A. Razborov (SIGACT News, 2007)

An Omega(n1/3) Lower Bound for Bilinear Group Based Private Information Retrieval. - Alexander A. Razborov; Sergey Yekhanin (Theory Comput., 2007)

The Sign-Rank of AC^O. - Alexander A. Razborov; Alexander A. Sherstov (FOCS, 2008)

Almost Euclidean subspaces of lN1 via expander codes. - Venkatesan Guruswami; James R. Lee; Alexander A. Razborov (SODA, 2008)

On the Minimal Density of Triangles in Graphs. - Alexander A. Razborov (Comb. Probab. Comput., 2008)

A simple proof of Bazzi's theorem. - Alexander A. Razborov (Electron. Colloquium Comput. Complex., 2008)

The Sign-Rank of AC^0. - Alexander A. Razborov; Alexander A. Sherstov (Electron. Colloquium Comput. Complex., 2008)

Resolution Is Not Automatizable Unless W[P] Is Tractable. - Michael Alekhnovich; Alexander A. Razborov (SIAM J. Comput., 2008)

The Ackermann Award 2009. - Johann A. Makowsky; Alexander A. Razborov (CSL, 2009)

On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution. - Jakob Nordström; Alexander A. Razborov (Electron. Colloquium Comput. Complex., 2009)

Complexity of Propositional Proofs. - Alexander A. Razborov (CSR, 2010)

Almost Euclidean subspaces of l 1N VIA expander codes. - Venkatesan Guruswami; James R. Lee; Alexander A. Razborov (Comb., 2010)

Parameterized Bounded-Depth Frege is Not Optimal. - Olaf Beyersdorff; Nicola Galesi; Massimo Lauria; Alexander A. Razborov (Electron. Colloquium Comput. Complex., 2010)

Diameter of Polyhedra: Limits of Abstraction. - Friedrich Eisenbrand; Nicolai Hähnle; Alexander A. Razborov; Thomas Rothvoß (Math. Oper. Res., 2010)

Preface. - Sergei N. Artëmov; Volker Diekert; Alexander A. Razborov (Theory Comput. Syst., 2010)

The Sign-Rank of AC0. - Alexander A. Razborov; Alexander A. Sherstov (SIAM J. Comput., 2010)

On 3-Hypergraphs with Forbidden 4-Vertex Configurations. - Alexander A. Razborov (SIAM J. Discret. Math., 2010)

On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution. - Jakob Nordström; Alexander A. Razborov (ICALP (1), 2011)

Satisfiability, Branch-Width and Tseitin tautologies. - Michael Alekhnovich; Alexander A. Razborov (Comput. Complex., 2011)

Special Issue In Memory of Misha Alekhnovich. Foreword. - Allan Borodin; Toniann Pitassi; Alexander A. Razborov (Comput. Complex., 2011)

Non-Three-Colourable Common Graphs Exist. - Hamed Hatami; Jan Hladký; Daniel Král'; Serguei Norine; Alexander A. Razborov (Comb. Probab. Comput., 2012)

Real Advantage. - Alexander A. Razborov; Emanuele Viola (Electron. Colloquium Comput. Complex., 2012)

On Small Size Approximation Models. - Alexander A. Razborov (The Mathematics of Paul Erdős I, 2013)

Flag Algebras: An Interim Report. - Alexander A. Razborov (The Mathematics of Paul Erdős II, 2013)

On the number of pentagons in triangle-free graphs. - Hamed Hatami; Jan Hladký; Daniel Král'; Serguei Norine; Alexander A. Razborov (J. Comb. Theory A, 2013)

On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs. - Alexander A. Razborov (J. Graph Theory, 2013)

On the AC0 Complexity of Subgraph Isomorphism. - Yuan Li; Alexander A. Razborov; Benjamin Rossman (FOCS, 2014)

An Ultimate Trade-Off in Propositional Proof Complexity. - Alexander A. Razborov (Electron. Colloquium Comput. Complex., 2015)

On the Width of Semi-Algebraic Proofs and Algorithms. - Alexander A. Razborov (Electron. Colloquium Comput. Complex., 2016)

A New Kind of Tradeoffs in Propositional Proof Complexity. - Alexander A. Razborov (J. ACM, 2016)

Guest Column: Proof Complexity and Beyond. - Alexander A. Razborov (SIGACT News, 2016)

Asymptotic Structure of Graphs with the Minimum Number of Triangles. - Oleg Pikhurko; Alexander A. Razborov (Comb. Probab. Comput., 2017)

On the Density of Transitive Tournaments. - Leonardo Nagami Coregliano; Alexander A. Razborov (J. Graph Theory, 2017)

On the Width of Semialgebraic Proofs and Algorithms. - Alexander A. Razborov (Math. Oper. Res., 2017)

On the AC0 Complexity of Subgraph Isomorphism. - Yuan Li; Alexander A. Razborov; Benjamin Rossman (SIAM J. Comput., 2017)

On Space and Depth in Resolution. - Alexander A. Razborov (Comput. Complex., 2018)

Semantic Limits of Dense Combinatorial Objects. - Leonardo Nagami Coregliano; Alexander A. Razborov (CoRR, 2019)

Clique Is Hard on Average for Regular Resolution. - Albert Atserias; Ilario Bonacina; Susanna F. de Rezende; Massimo Lauria; Jakob Nordström; Alexander A. Razborov (J. ACM, 2021)

Improved Convergence Guarantees for Shallow Neural Networks. - Alexander A. Razborov (CoRR, 2022)

An extremal problem motivated by triangle-free strongly regular graphs. - Alexander A. Razborov (J. Comb. Theory B, 2022)

On CDCL-Based Proof Systems with the Ordered Decision Strategy. - Nathan Mull; Shuo Pang 002; Alexander A. Razborov (SIAM J. Comput., 2022)

Natural quasirandomness properties. - Leonardo Nagami Coregliano; Alexander A. Razborov (Random Struct. Algorithms, 2023)

Space characterizations of complexity measures and size-space trade-offs in propositional proof systems. - Theodoros Papamakarios; Alexander A. Razborov (J. Comput. Syst. Sci., 2023)