| Publication | Date of Publication | Type |
|---|
| Space characterizations of complexity measures and size-space trade-offs in propositional proof systems | 2024-06-24 | Paper |
| Propositional proof complexity | 2023-11-10 | Paper |
| Natural quasirandomness properties | 2023-10-17 | Paper |
| Space characterizations of complexity measures and size-space trade-offs in propositional proof systems | 2023-07-10 | Paper |
| On small depth threshold circuits | 2022-12-09 | Paper |
| Clique Is Hard on Average for Regular Resolution | 2022-12-08 | Paper |
| On CDCL-Based Proof Systems with the Ordered Decision Strategy | 2022-08-25 | Paper |
| An extremal problem motivated by triangle-free strongly regular graphs | 2022-04-27 | Paper |
| More about sparse halves in triangle-free graphs | 2022-03-28 | Paper |
| Biregularity in Sidorenko's Conjecture | 2021-08-14 | Paper |
| Questions in algebra and mathematical logic. Scientific heritage of S. I. Adian | 2021-06-04 | Paper |
| Sergei Ivanovich Adian | 2021-06-04 | Paper |
| Polynomial to exponential transition in Ramsey theory | 2021-05-14 | Paper |
| On CDCL-based proof systems with the ordered decision strategy | 2021-04-07 | Paper |
| Semantic limits of dense combinatorial objects | 2020-12-03 | Paper |
| Clique is hard on average for regular resolution | 2019-08-22 | Paper |
| On space and depth in resolution | 2018-11-07 | Paper |
| A New Kind of Tradeoffs in Propositional Proof Complexity | 2018-08-02 | Paper |
| On the Width of Semialgebraic Proofs and Algorithms | 2017-12-07 | Paper |
| Asymptotic Structure of Graphs with the Minimum Number of Triangles | 2017-10-10 | Paper |
| Why are there so many loop formulas? | 2017-07-12 | Paper |
| On the Density of Transitive Tournaments | 2017-06-30 | Paper |
| On the $AC^0$ Complexity of Subgraph Isomorphism | 2017-05-30 | Paper |
| Natural proofs | 2016-09-01 | Paper |
| Propositional proof complexity | 2015-12-07 | Paper |
| Die Komplexität der Kommunikation | 2015-10-29 | Paper |
| WHAT IS... a Flag Algebra? | 2015-10-14 | Paper |
| A Simple Proof of Bazzi’s Theorem | 2015-09-24 | Paper |
| Parameterized Bounded-Depth Frege Is not Optimal | 2015-09-24 | Paper |
| Real Advantage | 2015-09-24 | Paper |
| Communication Complexity | 2015-06-26 | Paper |
| On Turán's \((3,4)\)-problem with forbidden subgraphs | 2015-05-08 | Paper |
| Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution | 2015-02-09 | Paper |
| Space complexity in propositional calculus | 2014-09-26 | Paper |
| On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem | 2014-08-04 | Paper |
| A product theorem in free groups. | 2014-04-14 | Paper |
| On the Caccetta-Häggkvist conjecture with forbidden subgraphs | 2013-10-21 | Paper |
| On the number of pentagons in triangle-free graphs | 2013-03-06 | Paper |
| Non-three-colourable common graphs exist | 2012-09-12 | Paper |
| Satisfiability, branch-width and Tseitin tautologies | 2012-06-26 | Paper |
| Special issue in memory of Misha Alekhnovich. Foreword | 2012-06-26 | Paper |
| Parameterized Bounded-Depth Frege Is Not Optimal | 2011-07-06 | Paper |
| On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution | 2011-07-06 | Paper |
| On 3-Hypergraphs with Forbidden 4-Vertex Configurations | 2011-06-17 | Paper |
| Sergei Ivanovich Adian (on his eightieth birthday) | 2011-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002789 | 2011-05-24 | Paper |
| Diameter of Polyhedra: Limits of Abstraction | 2011-04-27 | Paper |
| The Sign-Rank of AC$^0$ | 2010-11-04 | Paper |
| Almost Euclidean subspaces of \ell_1^N via expander codes | 2010-08-06 | Paper |
| Complexity of Propositional Proofs | 2010-06-22 | Paper |
| The Ackermann Award 2009 | 2009-11-12 | Paper |
| Resolution Is Not Automatizable Unless W[P] Is Tractable | 2009-08-20 | Paper |
| On the Minimal Density of Triangles in Graphs | 2008-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3522479 | 2008-09-03 | Paper |
| Flag algebras | 2008-02-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3433902 | 2007-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5703379 | 2005-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5702630 | 2005-11-02 | Paper |
| Guessing More Secrets via List Decoding | 2005-10-27 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4681889 | 2005-06-08 | Paper |
| Quantum communication complexity of symmetric predicates | 2005-05-17 | Paper |
| Pseudorandom Generators in Propositional Proof Complexity | 2005-02-21 | Paper |
| Resolution lower bounds for perfect matching principles | 2004-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818823 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737899 | 2004-08-11 | Paper |
| Lower bounds for polynomial calculus in the case of nonbinomial ideals. | 2004-06-15 | Paper |
| Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus | 2003-12-14 | Paper |
| Lower bounds for the polynomial calculus | 2003-12-07 | Paper |
| Resolution lower bounds for the weak functional pigeonhole principle. | 2003-08-17 | Paper |
| Space Complexity in Propositional Calculus | 2002-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527043 | 2001-03-01 | Paper |
| On P versus NP\(\cap\)co-NP for decision trees and read-once branching programs | 2000-11-20 | Paper |
| Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields. | 2000-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4699308 | 1999-11-10 | Paper |
| Improved lower bounds on the rigidity of Hadamard matrices | 1999-03-15 | Paper |
| Neither reading few bits twice nor reading illegally helps much | 1998-08-20 | Paper |
| Proof complexity in algebraic systems and bounded depth Frege systems with modular counting | 1998-06-29 | Paper |
| Natural proofs | 1997-12-03 | Paper |
| On the shrinkage exponent for read-once formulae | 1997-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2785568 | 1997-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4850554 | 1996-06-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4867093 | 1996-02-26 | Paper |
| Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic | 1996-02-25 | Paper |
| Constructing Small Sets that are Uniform in Arithmetic Progressions | 1994-11-20 | Paper |
| ON THE PARAMETERIZATION OF SOLUTIONS FOR EQUATIONS IN FREE GROUPS | 1994-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140640 | 1993-12-05 | Paper |
| On lower bounds for read-\(k\)-times branching programs | 1993-08-30 | Paper |
| Majority gates vs. general weighted threshold gates | 1993-08-08 | Paper |
| \(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036701 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038696 | 1993-05-18 | Paper |
| On the distributional complexity of disjointness | 1993-04-22 | Paper |
| The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear | 1993-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4000001 | 1992-09-18 | Paper |
| Lower bounds of the complexity of symmetric Boolean functions of contact- rectifier circuits | 1992-06-25 | Paper |
| Applications of matrix methods to the theory of lower bounds in computational complexity | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5202146 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3197333 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3826719 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3822097 | 1988-01-01 | Paper |
| Lower bounds on the size of bounded depth circuits over a complete basis with logical addition | 1987-01-01 | Paper |
| Periodic groups and Lie algebras | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3822100 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4724549 | 1986-01-01 | Paper |
| Lower estimates of the dimension of schemes of bounded depth in the basis $ \{\&,\vee,\oplus\}$ | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3758729 | 1985-01-01 | Paper |
| ON SYSTEMS OF EQUATIONS IN A FREE GROUP | 1985-01-01 | Paper |
| Lower bounds on monotone complexity of the logical permanent | 1985-01-01 | Paper |
