Pavel Pudlák
Pavel Pudlák publishes mostly in Computational Theory and Mathematics, Artificial Intelligence and Discrete Mathematics and Combinatorics, on topics such as Complexity and Algorithms in Graphs, Computability, Logic, AI Algorithms and Advanced Graph Theory Research.
- World rank
- #1,074,856 of 7,710,434 ranked researchers
- Rank in Czechia
- #1,876 of 39,303
- Works
- 292
- Citations
- 6.8k
- Citations per work
- 23.2
What does Pavel Pudlák research?
Pavel Pudlák's work is mostly in Computer Science (56%), Mathematics (7%), Medicine (3%).
Their six largest subfields, inside their fields and domains; the grey slice is everything else they publish. The interactive view splits every one of their works down to single topics.
The fields and subfields, with their numbers
- Physical Sciences19165.3%
- Computer Science16255.5%
- Mathematics206.8%
- Engineering93.0%
- Everything else9231.6%
- Health Sciences93.1%
- Medicine93.1%
- 1Computational Theory and Mathematics37% of their works
- 2Artificial Intelligence19% of their works
- 3Discrete Mathematics and Combinatorics4% of their works
- 4Hematology3% of their works
- 5Electrical and Electronic Engineering3% of their works
- 6Geometry and Topology3% of their works
Research topics
Which keywords describe Pavel Pudlák's research?
The keywords of their largest research topics: Algorithmic Applications, Approximation Algorithms, Model Checking, Combinatorial Optimization, Complexity Theory, Algorithmic Information Theory, Computability and Graph Theory.
- Automata
- Graph Limits
- Formal Verification
- Fuzzy Logic
- Answer Set Programming
- Graph Theory
- Algorithmic Information Theory
- Combinatorial Optimization
- Approximation Algorithms
- Algorithmic Applications
- Model Checking
- Complexity Theory
- Computability
- Parameterized Complexity
- Modal Logic
- Residuated Lattices
- Static Analysis
- Szemerédi's Theorem
- Formal Languages
Size is their works in the topics tagged with each word, from their 8 largest topics. Each links to the topic it comes from most. The words come from the keyword list OpenAlex gives each topic, not from the text of the papers, so a word can appear that none of the papers uses.
All 19 words, with their numbers
- Algorithmic Applications1072 topics
- Approximation Algorithms1072 topics
- Model Checking682 topics
- Combinatorial Optimization671 topic
- Complexity Theory671 topic
- Algorithmic Information Theory531 topic
- Computability531 topic
- Graph Theory401 topic
- Parameterized Complexity401 topic
- Answer Set Programming351 topic
- Modal Logic351 topic
- Fuzzy Logic341 topic
- Residuated Lattices341 topic
- Formal Verification331 topic
- Static Analysis331 topic
- Graph Limits281 topic
- Szemerédi's Theorem281 topic
- Automata261 topic
- Formal Languages261 topic
Where does Pavel Pudlák work?
Pavel Pudlák's main affiliation in the publication record is Czech Academy of Sciences, Institute of Mathematics, Czechia.
How many publications and citations does Pavel Pudlák have?
OpenAlex counts 292 works and 6,782 citations for Pavel Pudlák, an h-index of 40, ranking #1,074,856 of 7,710,434 researchers worldwide on the quality score.
Ranked on field-normalised citation excellence (50%), output (30%) and citations (20%). Counts come from OpenAlex author records, which occasionally merge different people who share a name or split one person into several.
Papers, co-authors, who cited this work and researchers on the nearest topics have tabs of their own, above. Is this your page? Claim it with your ORCID iD, or request a correction or removal.
Discussion
Ask a question or share a note about Pavel Pudlák. Keep it to the research: no personal attacks, advertising or links. Any reader can report a post, which collapses it for everyone until it is opened.