Professor, Academy of Sciences of the Czech Republic
Pavel Pudlak graduated from Charles University, Prague, in 1975. He received the title CSc (equivalent of PhD) from the Academy of Sciences of Czechoslovakia in 1978. Since then he has been working as a researcher at the Institute of Mathematics of the Czech Academy of Sciences and occasionally teaching at Charles University. He has held visiting positions at a number of universities in the US, Germany, Switzerland, France and Italy. He is currently leading a group of researchers at the Institute of Mathematics that work in logic and theoretical computer science.
Meta-Complexity , Spring 2023Visiting Scientist
Extended Reunion: Satisfiability , Spring 2023Visiting Scientist
Satisfiability: Theory, Practice, and Beyond , Spring 2021Visiting Scientist
Lower Bounds in Computational Complexity , Fall 2018Visiting Scientist
Fine-Grained Complexity and Algorithm Design , Fall 2015Visiting Scientist