Polynomially Complete Problems in the Logic of Automated Discovery. - Pavel Pudlák (MFCS, 1975)

Complexity in Mechanized Hypothesis Formation. - Pavel Pudlák; Frederick N. Springsteel (Theor. Comput. Sci., 1979)

Partition theorems for systems of finite subsets of integers. - Pavel Pudlák; Vojtech Rödl (Discret. Math., 1982)

Bounds for Hodes-Specker theorem. - Pavel Pudlák (Logic and Machines, 1983)

New Lower Bound for Polyhedral Membership Problem with an Application to Linear Programming. - Jaroslav Morávek; Pavel Pudlák (MFCS, 1984)

A Lower Bound on Complexity of Branching Programs (Extended Abstract). - Pavel Pudlák (MFCS, 1984)

Models of the Alternative Set Theory. - Pavel Pudlák; Antonín Sochor (J. Symb. Log., 1984)

Cuts, Consistency Statements and Interpretations. - Pavel Pudlák (J. Symb. Log., 1985)

Elementary Extensions of Models of the Alternative Set Theory. - Pavel Pudlák; Antonín Sochor (Math. Log. Q., 1985)

Two lower bounds for branching programs - Miklós Ajtai; László Babai; Péter Hajnal; János Komlós; Pavel Pudlák; Vojtech Rödl; Endre Szemerédi; György Turán (STOC, 1986)

Graph Complexity. - Pavel Pudlák; Vojtech Rödl; Petr Savický (Acta Informatica, 1988)

The number of proof lines and the size of proofs in first order logic. - Jan Krajícek; Pavel Pudlák (Arch. Math. Log., 1988)

Propositional Provability and Models of Weak Arithmetic. - Jan Krajícek; Pavel Pudlák (CSL, 1989)

On the Communication Complexity of Planarity. - Pavol Duris; Pavel Pudlák (FCT, 1989)

On the structure of initial segments of models of arithmetic. - Jan Krajícek; Pavel Pudlák (Arch. Math. Log., 1989)

Propositional Proof Systems, the Consistency of First Order Theories and the Complexity of Computations. - Jan Krajícek; Pavel Pudlák (J. Symb. Log., 1989)

Ramsey's Theorem in Bounded Arithmetic. - Pavel Pudlák (CSL, 1990)

Interactive Computations of Optimal Solutions. - Jan Krajícek; Pavel Pudlák; Jirí Sgall (MFCS, 1990)

Quantified propositional calculi and fragments of bounded arithmetic. - Jan Krajícek; Pavel Pudlák (Math. Log. Q., 1990)

Lower Bounds to the Complexity of Symmetric Boolean Functions. - László Babai; Pavel Pudlák; Vojtech Rödl; Endre Szemerédi (Theor. Comput. Sci., 1990)

Bounded Arithmetic and the Polynomial Hierarchy. - Jan Krajícek; Pavel Pudlák; Gaisi Takeuti (Ann. Pure Appl. Log., 1991)

Exponential Lower Bounds for the Pigeonhole Principle - Paul Beame; Russell Impagliazzo; Jan Krajícek; Toniann Pitassi; Pavel Pudlák; Alan R. Woods (STOC, 1992)

A combinatorial approach to complexity. - Pavel Pudlák; Vojtech Rödl (Comb., 1992)

Metamathematics of First-Order Arithmetic. - Petr Hájek 001; Pavel Pudlák (Springer, 1993)

AC0 Circuit Complexity. - Pavel Pudlák (FCT, 1993)

Top-Down Lower Bounds for Depth 3 Circuits - Johan Håstad; Stasys Jukna; Pavel Pudlák (FOCS, 1993)

Modified ranks of tensors and the size of circuits. - Pavel Pudlák; Vojtech Rödl (STOC, 1993)

Threshold Circuits of Bounded Depth. - András Hajnal; Wolfgang Maass 001; Pavel Pudlák; Mario Szegedy; György Turán (J. Comput. Syst. Sci., 1993)

On shifting networks. - Pavel Pudlák; Petr Savický (Theor. Comput. Sci., 1993)

Complexity Theory and Genetics. - Pavel Pudlák (SCT, 1994)

How to Lie Without Being (Easily) Convicted and the Length of Proofs in Propositional Calculus. - Pavel Pudlák; Samuel R. Buss (CSL, 1994)

Lower Bound on Hilbert's Nullstellensatz and propositional proofs - Paul Beame; Russell Impagliazzo; Jan Krajícek; Toniann Pitassi; Pavel Pudlák (FOCS, 1994)

Unexpected Upper Bounds on the Complexity of Some Communication Games. - Pavel Pudlák (ICALP, 1994)

Some Consequences of Cryptographical Conjectures for S_2^1 and EF. - Jan Krajícek; Pavel Pudlák (LCC, 1994)

Communication in Bounded Depth Circuits. - Pavel Pudlák (Comb., 1994)

Some combinatorial-algebraic problems from complexity theory. - Pavel Pudlák; Vojtech Rödl (Discret. Math., 1994)

Complexity Theory and Genetics (extended abstract) - Pavel Pudlák (Electron. Colloquium Comput. Complex., 1994)

An Exponential Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle - Jan Krajícek; Pavel Pudlák; Alan R. Woods (Electron. Colloquium Comput. Complex., 1994)

Superconcentrators of Depths 2 and 3; Odd Levels Help (Rarely). - Noga Alon; Pavel Pudlák (J. Comput. Syst. Sci., 1994)

On Computing Boolean Functions by Sparse Real Polynomials. - Matthias Krause 001; Pavel Pudlák (FOCS, 1995)

Top-Down Lower Bounds for Depth-Three Circuits. - Johan Håstad; Stasys Jukna; Pavel Pudlák (Comput. Complex., 1995)

An Upper Bound for a Communication Game Related to Time-Space Tradeoffs - Pavel Pudlák; Jirí Sgall (Electron. Colloquium Comput. Complex., 1995)

An Exponenetioal Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle. - Jan Krajícek; Pavel Pudlák; Alan R. Woods (Random Struct. Algorithms, 1995)

On Sparse Parity Chack Matrices (Extended Abstract). - Hanno Lefmann; Pavel Pudlák; Petr Savický (COCOON, 1996)

Algebraic models of computation and interpolation for algebraic proof systems. - Pavel Pudlák; Jirí Sgall (Proof Complexity and Feasible Arithmetics, 1996)

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)

On Sparse Parity Check Matrices. - Hanno Lefmann; Pavel Pudlák; Petr Savický (Des. Codes Cryptogr., 1997)

Lower Bounds for the Polynomial Calculus and the Groebner Basis Algorithm - Russell Impagliazzo; Pavel Pudlák; Jirí Sgall (Electron. Colloquium Comput. Complex., 1997)

Lower Bounds for Resolution and Cutting Plane Proofs and Monotone Computations. - Pavel Pudlák (J. Symb. Log., 1997)

Boolean Circuits, Tensor Ranks, and Communication Complexity. - Pavel Pudlák; Vojtech Rödl; Jirí Sgall (SIAM J. Comput., 1997)

On the Computational Power of Depth-2 Circuits with Threshold and Modulo Gates. - Matthias Krause 001; Pavel Pudlák (Theor. Comput. Sci., 1997)

Satisfiability - Algorithms and Logic. - Pavel Pudlák (MFCS, 1998)

Computing Boolean Functions by Polynomials and Threshold Circuits. - Matthias Krause 001; Pavel Pudlák (Comput. Complex., 1998)

Some Consequences of Cryptographical Conjectures for S12 and EF. - Jan Krajícek; Pavel Pudlák (Inf. Comput., 1998)

A Note on Applicability of the Incompleteness Theorem to Human Mind. - Pavel Pudlák (Ann. Pure Appl. Log., 1999)

Lower Bounds for the Polynomial Calculus and the Gröbner Basis Algorithm. - Russell Impagliazzo; Pavel Pudlák; Jirí Sgall (Comput. Complex., 1999)

Satisfiability Coding Lemma. - Ramamohan Paturi; Pavel Pudlák; Francis Zane (Chic. J. Theor. Comput. Sci., 1999)

A lower bound for DLL algorithms for k-SAT (preliminary version). - Pavel Pudlák; Russell Impagliazzo (SODA, 2000)

Monotone simulations of nonmonotone propositional proofs - Albert Atserias; Nicola Galesi; Pavel Pudlák (Electron. Colloquium Comput. Complex., 2000)

A note on the use of determinant for proving lower bounds on the size of linear circuits. - Pavel Pudlák (Inf. Process. Lett., 2000)

Proofs as Games. - Pavel Pudlák (Am. Math. Mon., 2000)

Some structural properties of low-rank matrices related to computational complexity. - Bruno Codenotti; Pavel Pudlák; Giovanni Resta (Theor. Comput. Sci., 2000)

Monotone Simulations of Nonmonotone Proofs. - Albert Atserias; Nicola Galesi; Pavel Pudlák (CCC, 2001)

On the computational content of intuitionistic propositional proofs. - Samuel R. Buss; Pavel Pudlák (Ann. Pure Appl. Log., 2001)

Complexity Theory and Genetics: The Computational Power of Crossing Over. - Pavel Pudlák (Inf. Comput., 2001)

Gust Editor's Foreword. - Pavel Pudlák (J. Comput. Syst. Sci., 2001)

Cycles of Nonzero Elements in Low Rank Matrices. - Pavel Pudlák (Comb., 2002)

Monotone complexity and the rank of matrices - Pavel Pudlák (Electron. Colloquium Comput. Complex., 2002)

Monotone simulations of non-monotone proofs. - Albert Atserias; Nicola Galesi; Pavel Pudlák (J. Comput. Syst. Sci., 2002)

An Application of Hindman's Theorem to a Problem on Communication Complexity. - Pavel Pudlák (Comb. Probab. Comput., 2003)

A note on monotone complexity and the rank of matrices. - Anna Gál; Pavel Pudlák (Inf. Process. Lett., 2003)

Erratum to: "A note on monotone complexity and the rank of matrices": [Information Processing Letters 87 (2003) 321-326]. - Anna Gál; Pavel Pudlák (Inf. Process. Lett., 2003)

Parallel strategies. - Pavel Pudlák (J. Symb. Log., 2003)

On reducibility and symmetry of disjoint NP pairs. - Pavel Pudlák (Theor. Comput. Sci., 2003)

Circuit lower bounds and linear codes - Ramamohan Paturi; Pavel Pudlák (Electron. Colloquium Comput. Complex., 2004)

Bounded-depth circuits: separating wires from gates. - Michal Koucký 001; Pavel Pudlák; Denis Thérien (STOC, 2005)

A nonlinear bound on the number of wires in bounded depth circuits - Pavel Pudlák (Electron. Colloquium Comput. Complex., 2005)

An improved exponential-time algorithm for k-SAT. - Ramamohan Paturi; Pavel Pudlák; Michael E. Saks; Francis Zane (J. ACM, 2005)

On Search Problems in Complexity Theory and in Logic (Abstract). - Pavel Pudlák (CIAC, 2006)

Godel and Computations (Abstract). - Pavel Pudlák (CCC, 2006)

06111 Executive Summary – Complexity of Boolean Functions. - Matthias Krause 001; Dieter van Melkebeek; Pavel Pudlák; Rüdiger Reischuk (Complexity of Boolean Functions, 2006)

06111 Abstracts Collection – Complexity of Boolean Functions. - Matthias Krause 001; Pavel Pudlák; Rüdiger Reischuk; Dieter van Melkebeek (Complexity of Boolean Functions, 2006)

Lower bounds for circuits with MOD_m gates. - Arkadev Chattopadhyay; Navin Goyal; Pavel Pudlák; Denis Thérien (FOCS, 2006)

Gödel and computations: a 100th anniversary retrospective. - Pavel Pudlák (SIGACT News, 2006)

Exponential Separation of Quantum and Classical Non-Interactive Multi-Party Communication Complexity. - Dmitry Gavinsky; Pavel Pudlák (Electron. Colloquium Comput. Complex., 2007)

Quantum deduction rules. - Pavel Pudlák (Electron. Colloquium Comput. Complex., 2007)

Twelve Problems in Proof Complexity. - Pavel Pudlák (CSR, 2008)

Fragments of bounded arithmetic and the lengths of proofs. - Pavel Pudlák (J. Symb. Log., 2008)

Backtracking Based k-SAT Algorithms. - Ramamohan Paturi; Pavel Pudlák; Michael E. Saks; Francis Zane (Encyclopedia of Algorithms, 2008)

On extracting computations from propositional proofs (a survey). - Pavel Pudlák (FSTTCS, 2010)

On the complexity of circuit satisfiability. - Ramamohan Paturi; Pavel Pudlák (STOC, 2010)

Pseudorandom Generators for Group Products. - Michal Koucký 001; Prajakta Nimbhorkar; Pavel Pudlák (Electron. Colloquium Comput. Complex., 2010)

Some constructive bounds on Ramsey numbers. - Alexandr V. Kostochka; Pavel Pudlák; Vojtech Rödl (J. Comb. Theory B, 2010)

On convex complexity measures. - Pavel Hrubes; Stasys Jukna; Alexander S. Kulikov; Pavel Pudlák (Theor. Comput. Sci., 2010)

Pseudorandom generators for group products: extended abstract. - Michal Koucký 001; Prajakta Nimbhorkar; Pavel Pudlák (STOC, 2011)

Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. - Anna Gál; Kristoffer Arnsfelt Hansen; Michal Koucký 001; Pavel Pudlák; Emanuele Viola (Electron. Colloquium Comput. Complex., 2011)

Alternating minima and maxima, Nash equilibria and Bounded Arithmetic. - Pavel Pudlák; Neil Thapen (Ann. Pure Appl. Log., 2012)

A lower bound on the size of resolution proofs of the Ramsey theorem. - Pavel Pudlák (Inf. Process. Lett., 2012)

Logical Foundations of Mathematics and Computational Complexity - A Gentle Introduction. - Pavel Pudlák (Springer, 2013)

An Upper Bound for a Communication Game Related to Time-Space Tradeoffs. - Pavel Pudlák; Jirí Sgall (The Mathematics of Paul Erdős I, 2013)

Linear tree codes and the problem of explicit constructions. - Pavel Pudlák (CoRR, 2013)

The complexity of proving that a graph is Ramsey. - Massimo Lauria; Pavel Pudlák; Vojtech Rödl; Neil Thapen (Electron. Colloquium Comput. Complex., 2013)

Parity Games and Propositional Proofs. - Pavel Pudlák; Arnold Beckmann; Neil Thapen (Electron. Colloquium Comput. Complex., 2013)

The space complexity of cutting planes refutations. - Nicola Galesi; Pavel Pudlák; Neil Thapen (Electron. Colloquium Comput. Complex., 2014)

Partition Expanders. - Dmitry Gavinsky; Pavel Pudlák (Electron. Colloquium Comput. Complex., 2014)

On the complexity of finding falsifying assignments for Herbrand disjunctions. - Pavel Pudlák (Arch. Math. Log., 2015)

On the Entropy of Locally-Independent Bernoulli Trials. - Dmitry Gavinsky; Pavel Pudlák (CoRR, 2015)

Backtracking Based k-SAT Algorithms. - Ramamohan Paturi; Pavel Pudlák; Michael E. Saks; Francis Zane (Encyclopedia of Algorithms, 2016)

Tighter Hard Instances for PPSZ. - Pavel Pudlák; Dominik Scheder; Navid Talebanfard (ICALP, 2017)

Incompleteness in the finite Domain. - Pavel Pudlák (Bull. Symb. Log., 2017)

Petr Hajek, 1940-2016. - Pavel Pudlák (Bull. EATCS, 2017)

Random formulas, monotone circuits, and interpolation. - Pavel Hrubes; Pavel Pudlák (Electron. Colloquium Comput. Complex., 2017)

Representations of Monotone Boolean Functions by Linear Programs. - Mateus de Oliveira Oliveira; Pavel Pudlák (Electron. Colloquium Comput. Complex., 2017)

A wild model of linear arithmetic and discretely ordered modules. - Petr Glivický; Pavel Pudlák (Math. Log. Q., 2017)

Beating Brute Force for (Quantified) Satisfiability of Circuits of Bounded Treewidth. - Daniel Lokshtanov; Ivan Mikhailin; Ramamohan Paturi; Pavel Pudlák (SODA, 2018)

Proof Complexity (Dagstuhl Seminar 18051). - Albert Atserias; Jakob Nordström; Pavel Pudlák; Rahul Santhanam (Dagstuhl Reports, 2018)

A note on monotone real circuits. - Pavel Hrubes; Pavel Pudlák (Inf. Process. Lett., 2018)

Random resolution refutations. - Pavel Pudlák; Neil Thapen (Comput. Complex., 2019)

Extractors for small zero-fixing sources. - Pavel Pudlák; Vojtech Rödl (Electron. Colloquium Comput. Complex., 2019)

Santha-Vazirani sources, deterministic condensers and very strong extractors. - Dmitry Gavinsky; Pavel Pudlák (Theory Comput. Syst., 2020)

The canonical pairs of bounded depth Frege systems. - Pavel Pudlák (Ann. Pure Appl. Log., 2021)

Linear Branching Programs and Directional Affine Extractors. - Svyatoslav Gryaznov; Pavel Pudlák; Navid Talebanfard (CCC, 2022)

On matrices potentially useful for tree codes. - Pavel Pudlák (Inf. Process. Lett., 2022)

Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters. - Pavel Dvorák; Lukás Folwarczný; Michal Opler; Pavel Pudlák; Robert Sámal; Tung Anh Vu (WG, 2023)

Reviews. - Pavel Pudlák (Bull. Symb. Log., 2023)

Local Enumeration and Majority Lower Bounds. - Mohit Gurumukhani; Ramamohan Paturi; Pavel Pudlák; Michael E. Saks; Navid Talebanfard (CCC, 2024)

On the Ramsey numbers of daisies I. - Pavel Pudlák; Vojtech Rödl; Marcelo Tadeu Sales (Comb. Probab. Comput., 2024)