2026 Pavel Pudlák: Mathematics Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Mathematics	45	1461	1256	8	5	199	9235

Discipline name

D-Index

World Ranking

Current World Ranking

National Ranking

Current National Ranking

Publications

Citations

Mathematics

1461

1256

199

9235

Overview

Pavel Pudlák is affiliated with the Czech Academy of Sciences in the Czech Republic. Their research primarily spans the fields of Computer Science and Mathematics, contributing extensively to topics related to computational theory and mathematical foundations.

The scientist's main fields of study include:

Computer Science
Mathematics

Within these domains, their subfields of study cover:

Computational Theory and Mathematics
Artificial Intelligence
Discrete Mathematics and Combinatorics
Geometry and Topology
Computer Vision and Pattern Recognition

The primary research topics addressed in their work encompass:

Computability, Logic, AI Algorithms
Limits and Structures in Graph Theory
Complexity and Algorithms in Graphs
Machine Learning and Algorithms
Logic, Reasoning, and Knowledge
Advanced Topology and Set Theory
Advanced Graph Theory Research

Pavel Pudlák has published in a variety of venues, with frequent presence in:

arXiv (Cornell University)
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
COMBINATORICA
Theory of Computing Systems
Annals of Pure and Applied Logic

Recent peer-reviewed papers include:

"Linear Branching Programs and Directional Affine Extractors," 2022, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
"Extractors for Small Zero-Fixing Sources," 2022, COMBINATORICA
"Santha-Vazirani sources, deterministic condensers and very strong extractors," 2020, Theory of Computing Systems
"The canonical pairs of bounded depth Frege systems," 2020, Annals of Pure and Applied Logic
"Depth-d Frege Systems Are Not Automatable Unless = NP," 2024, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Frequent collaborators of Pavel Pudlák include:

Vojtěch Rödl
Navid Talebanfard
Svyatoslav Gryaznov
Pavel Dvořák
Lukáš Folwarczný

Best Publications

Metamathematics of First-Order Arithmetic

Petr Hájek;Pavel Pudlák

1146
Citations
Lower Bounds for Resolution and Cutting Plane Proofs and Monotone Computations

Pavel Pudlák

572
Citations
Threshold circuits of bounded depth

András Hajnal;András Hajnal;Wolfgang Maass;Wolfgang Maass;Pavel Pudlák;Pavel Pudlák;György Turán;György Turán

492
Citations
Threshold circuits of bounded depth

Andras Hajnal;Wolfgang Maass;Pavel Pudlak;Mario Szegedy

414
Citations
An improved exponential-time algorithm for k-SAT

Ramamohan Paturi;Pavel Pudlák;Michael E. Saks;Francis Zane

390
Citations
Satisfiability Coding Lemma.

Ramamohan Paturi;Pavel Pudlák;Francis Zane

236
Citations
Propositional Proof Systems, the Consistency of First Order Theories and the Complexity of Computations

Jan Krajíček;Pavel Pudlák

228
Citations
An exponential lower bound to the size of bounded depth Frege proofs of the Pigeonhole Principle

Jan Krajíček;Pavel Pudlák;Alan Woods

209
Citations
Bounded arithmetic and the polynomial hierarchy

Jan Krajíček;Pavel Pudlák;Gaisi Takeuti

206
Citations
Chapter VIII - The Lengths of Proofs

Pavel Pudlák

203
Citations
An improved exponential-time algorithm for k-SAT

R. Paturi;P. Pudlik;M.E. Saks;F. Zane

184
Citations
Cuts, consistency statements and interpretations

Pavel Pudlák

181
Citations
Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs

Paul Beame;Russell Impagliazzo;Jan Krajíček;Toniann Pitassi

171
Citations
Some consequences of cryptographical conjectures for S 1 2 and EF

Jan Krajíček;Pavel Pudlák

161
Citations
Every finite lattice can be embedded in a finite partition lattice

Pavel Pudlák;Jiří T⫲ma

158
Citations
Lower bounds for the polynomial calculus and the Gröbner basis algorithm

Russell Impagliazzo;Pavel Pudlák;Jiří Sgall

148
Citations
On the computational power of depth-2 circuits with threshold and modulo gates

Matthias Krause;Pavel Pudlák

141
Citations
Exponential lower bounds for the pigeonhole principle

Paul Beame;Russell Impagliazzo;Jan Krajíček;Toniann Pitassi

134
Citations
Proof complexity in algebraic systems and bounded depth Frege systems with modular counting

S. Buss;R. Impagliazzo;J. Krajíček;P. Pudlák

130
Citations
Quantified propositional calculi and fragments of bounded arithmetic

Jan Krajíček;Pavel Pudlák

121
Citations
Lower Bounds for the Polynomial Calculus and the Groebner Basis Algorithm

Russell Impagliazzo;Pavel Pudlák;Jirí Sgall

26
Citations

Frequent Co-Authors

Petr Hájek Czech Academy of Sciences

Samuel R. Buss University of California, San Diego

Ramamohan Paturi University of California, San Diego

Russell Impagliazzo University of California, San Diego

Noga Alon Tel Aviv University

Paul Beame University of Washington

Vojtěch Rödl Emory University

Wolfgang Maass Graz University of Technology

Toniann Pitassi Columbia University

Michael Saks Rutgers, The State University of New Jersey

External Links

Personal website of Pavel Pudlák

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring related online degrees can complement your mathematics studies by broadening career opportunities. For those interested in business applications, the fastest MBA programs online offer accelerated paths to leadership roles, allowing students to quickly gain management skills alongside analytical expertise.

Marketing professionals with a strong mathematical background are in demand, and pursuing a master's degree in marketing can open doors to strategic roles that leverage data analytics and consumer insights.

If efficiency matters, consider exploring the one year MBA options, which combine rigor and speed, allowing math graduates to quickly pivot into business environments.

Additionally, flexibility in education is key. Many programs allow course credit transfer, and understanding can you transfer MBA credits can help students save time and resources while advancing their degrees.