| Linear Branching Programs and Directional Affine Extractors | 0 | 0.34 | 2022 |
| Extractors for small zero-fixing sources. | 0 | 0.34 | 2019 |
| A note on monotone real circuits. | 1 | 0.35 | 2018 |
| Proof Complexity (Dagstuhl Seminar 18051). | 0 | 0.34 | 2018 |
| Representations of Monotone Boolean Functions by Linear Programs | 0 | 0.34 | 2017 |
| Petr Hajek, 1940-2016. | 0 | 0.34 | 2017 |
| INCOMPLETENESS IN THE FINITE DOMAIN | 0 | 0.34 | 2017 |
| A wild model of linear arithmetic and discretely ordered modules. | 1 | 0.41 | 2017 |
| Random resolution refutations. | 1 | 0.41 | 2017 |
| Tighter Hard Instances for PPSZ. | 1 | 0.37 | 2017 |
| On the Entropy of Locally-Independent Bernoulli Trials. | 0 | 0.34 | 2015 |
| On the complexity of finding falsifying assignments for Herbrand disjunctions. | 2 | 0.37 | 2015 |
| The space complexity of cutting planes refutations. | 2 | 0.37 | 2014 |
| Parity Games and Propositional Proofs | 5 | 0.49 | 2014 |
| Partition Expanders. | 0 | 0.34 | 2014 |
| Linear tree codes and the problem of explicit constructions. | 2 | 0.37 | 2013 |
| Parity Games and Propositional Proofs. | 0 | 0.34 | 2013 |
| The complexity of proving that a graph is ramsey | 6 | 0.43 | 2013 |
| Alternating minima and maxima, Nash equilibria and Bounded Arithmetic. | 4 | 0.46 | 2012 |
| A lower bound on the size of resolution proofs of the Ramsey theorem | 3 | 0.40 | 2012 |
| Pseudorandom generators for group products: extended abstract | 18 | 0.66 | 2011 |
| On extracting computations from propositional proofs (a survey) | 2 | 0.38 | 2010 |
| On the complexity of circuit satisfiability | 9 | 0.57 | 2010 |
| Pseudorandom Generators for Group Products | 6 | 0.46 | 2010 |
| Some constructive bounds on Ramsey numbers | 3 | 0.40 | 2010 |
| Fragments of bounded arithmetic and the lengths of proofs. | 5 | 0.53 | 2008 |
| Twelve Problems in Proof Complexity | 5 | 0.44 | 2008 |
| Quantum deduction rules | 1 | 0.35 | 2007 |
| Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity | 5 | 0.44 | 2007 |
| Gödel and computations: a 100th anniversary retrospective | 1 | 0.35 | 2006 |
| 06111 Executive Summary -- Complexity of Boolean Functions | 0 | 0.34 | 2006 |
| Complexity of Boolean Functions, 12.03. - 17.03.2006 | 16 | 1.40 | 2006 |
| 06111 Abstracts Collection -- Complexity of Boolean Functions | 0 | 0.34 | 2006 |
| Godel and Computations (Abstract) | 0 | 0.34 | 2006 |
| On search problems in complexity theory and in logic (abstract) | 0 | 0.34 | 2006 |
| Bounded-depth circuits: separating wires from gates | 13 | 0.85 | 2005 |
| A nonlinear bound on the number of wires in bounded depth circuits | 0 | 0.34 | 2005 |
| Circuit lower bounds and linear codes | 5 | 0.42 | 2004 |
| On reducibility and symmetry of disjoint NP pairs | 28 | 0.93 | 2003 |
| A note on monotone complexity and the rank of matrices | 15 | 0.78 | 2003 |
| An Application of Hindman's Theorem to a Problem on Communication Complexity | 4 | 0.46 | 2003 |
| Erratum to: "A note on monotone complexity and the rank of matrices": [Information Processing Letters 87 (2003) 321-326] | 0 | 0.34 | 2003 |
| Parallel strategies | 0 | 0.34 | 2003 |
| Monotone complexity and the rank of matrices | 7 | 0.54 | 2002 |
| Monotone simulations of non-monotone proofs | 12 | 0.78 | 2002 |
| Cycles of Nonzero Elements in Low Rank Matrices | 3 | 0.54 | 2002 |
| On the computational content of intuitionistic propositional proofs | 12 | 0.79 | 2001 |
| On reducibility and symmetry of disjoint NP-pairs | 0 | 0.34 | 2001 |
| A note on the use of determinant for proving lower bounds on the size of linear circuits | 4 | 0.49 | 2000 |
| Monotone simulations of nonmonotone propositional proofs | 0 | 0.34 | 2000 |
