Karol Pąk
Impact in
- Theoretical Computer Science top 5%
-
- Formal Methods in Verification
- Mathematics, Computing, and Information Processing
- Rough Sets and Fuzzy Logic
Papers in
-
- Matrix Theory and Algorithms 7
- Computability, Logic, AI Algorithms 5
-
- Logic, programming, and type systems 25
- Logic, Reasoning, and Knowledge 13
- Semantic Web and Ontologies 9
- Security and Verification in Computing 5
- Co-authors
- Artur Korniłowicz (6 shared papers)Roman Matuszewski (2 shared papers)Grzegorz Bancerek (2 shared papers)Adam Grabowski (2 shared papers)Czesław Byliński (2 shared papers)Adam Naumowicz (2 shared papers)Josef Urban (2 shared papers)Cezary Kaliszyk (8 shared papers)
In The Last Decade
Karol Pąk
63 papers receiving 508 citations
Peers
Comparison fields: 5 of 43
- Theoretical Computer Science 30
- Computational Theory and Mathematics 294
- Artificial Intelligence 395
- Algebra and Number Theory 50
- Geometry and Topology 84
Countries citing papers authored by Karol Pąk
This map shows the geographic impact of Karol Pąk's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Karol Pąk with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Karol Pąk more than expected).
Fields of papers citing papers by Karol Pąk
This network shows the impact of papers produced by Karol Pąk. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Karol Pąk. The network helps show where Karol Pąk may publish in the future.
Co-authors
The 12 scholars most cited alongside Karol Pąk, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 72 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2015 | 169 | |
| 2 | 2017 | 143 | |
| 3 | 2012 | 27 | |
| 4 | 2015 | 18 | |
| 5 | 2007 | 15 | |
| 6 | 2014 | 15 | |
| 7 | 2016 | 13 | |
| 8 | THE ALGORITHMS FOR IMPROVING AND REORGANIZING NATURAL DEDUCTION PROOFS | 2010 | 11 |
| 9 | 2009 | 9 | |
| 10 | 2017 | 8 | |
| 11 | 2008 | 7 | |
| 12 | 2014 | 7 | |
| 13 | 2007 | 6 | |
| 14 | 2018 | 6 | |
| 15 | 2018 | 5 | |
| 16 | 2008 | 5 | |
| 17 | 2007 | 5 | |
| 18 | 2006 | 5 | |
| 19 | 2017 | 5 | |
| 20 | 2017 | 5 |
About Karol Pąk
Karol Pąk is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Geometry and Topology, Algebra and Number Theory and Mathematical Physics, having authored 72 papers that have together received 577 indexed citations. Recurring topics across this work include Logic, programming, and type systems (25 papers), Logic, Reasoning, and Knowledge (13 papers), Semantic Web and Ontologies (9 papers), Matrix Theory and Algorithms (7 papers), Digital Image Processing Techniques (6 papers), Computability, Logic, AI Algorithms (5 papers), graph theory and CDMA systems (5 papers) and Security and Verification in Computing (5 papers). The work is most often cited by research in Theoretical Computer Science (30 citations), Computational Theory and Mathematics (294 citations), Artificial Intelligence (395 citations), Algebra and Number Theory (50 citations) and Geometry and Topology (84 citations). Karol Pąk has collaborated with scholars based in Poland, Austria and Czechia. Frequent co-authors include Artur Korniłowicz, Roman Matuszewski, Grzegorz Bancerek, Adam Grabowski, Czesław Byliński, Adam Naumowicz, Josef Urban, Cezary Kaliszyk, Andrzej Trybulec and Dominik Tomaszuk. Their work appears in journals such as Journal of Automated Reasoning, Logical Methods in Computer Science, PLoS ONE, Lecture notes in computer science and Studies in Logic Grammar and Rhetoric.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.