Witold Charatonik
Impact in
-
- Formal Methods in Verification
- semigroups and automata theory
- Artificial Intelligence top 5%
- Logic, programming, and type systems
- Logic, Reasoning, and Knowledge
- Cryptography and Data Security
Papers in
-
- Formal Methods in Verification 30
- semigroups and automata theory 11
- Advanced Algebra and Logic 3
-
- Logic, programming, and type systems 25
- Logic, Reasoning, and Knowledge 21
- Semantic Web and Ontologies 3
- Co-authors
- Andreas Podelski (9 shared papers)Roberto M. Amadio (2 shared papers)Leszek Pacholski (4 shared papers)Jean-Marc Talbot (5 shared papers)Andrew D. Gordon (3 shared papers)Supratik Mukhopadhyay (4 shared papers)Silvano Dal Zilio (2 shared papers)Emanuel Kieroński (4 shared papers)
In The Last Decade
Witold Charatonik
47 papers receiving 366 citations
Peers
Comparison fields: 5 of 24
- Computational Theory and Mathematics 272
- Artificial Intelligence 331
- Computer Networks and Communications 140
- Software 21
- Information Systems 64
Countries citing papers authored by Witold Charatonik
This map shows the geographic impact of Witold Charatonik'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 Witold Charatonik with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Witold Charatonik more than expected).
Fields of papers citing papers by Witold Charatonik
This network shows the impact of papers produced by Witold Charatonik. 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 Witold Charatonik. The network helps show where Witold Charatonik may publish in the future.
Co-authors
The 15 scholars most cited alongside Witold Charatonik, 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 49 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2002 | 50 | |
| 2 | 2002 | 33 | |
| 3 | 2003 | 26 | |
| 4 | Automata on DAG representations of finite trees | 1999 | 23 |
| 5 | 2002 | 18 | |
| 6 | 2002 | 18 | |
| 7 | 2002 | 18 | |
| 8 | 2013 | 17 | |
| 9 | 1998 | 15 | |
| 10 | 1998 | 15 | |
| 11 | 2001 | 13 | |
| 12 | 1996 | 11 | |
| 13 | 2013 | 11 | |
| 14 | 2002 | 10 | |
| 15 | 1993 | 9 | |
| 16 | 1998 | 8 | |
| 17 | 2016 | 7 | |
| 18 | 2014 | 6 | |
| 19 | 2008 | 6 | |
| 20 | 2008 | 6 |
About Witold Charatonik
Witold Charatonik is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Software and Mathematical Physics, having authored 49 papers that have together received 401 indexed citations. Recurring topics across this work include Formal Methods in Verification (30 papers), Logic, programming, and type systems (25 papers), Logic, Reasoning, and Knowledge (21 papers), semigroups and automata theory (11 papers), Constraint Satisfaction and Optimization (7 papers), Advanced Algebra and Logic (3 papers), Distributed systems and fault tolerance (3 papers) and Semantic Web and Ontologies (3 papers). The work is most often cited by research in Computational Theory and Mathematics (272 citations), Artificial Intelligence (331 citations), Computer Networks and Communications (140 citations), Software (21 citations) and Information Systems (64 citations). Witold Charatonik has collaborated with scholars based in Poland, Germany and France. Frequent co-authors include Andreas Podelski, Roberto M. Amadio, Leszek Pacholski, Jean-Marc Talbot, Andrew D. Gordon, Supratik Mukhopadhyay, Silvano Dal Zilio, Emanuel Kieroński, Małgorzata Biernacka and Michael Benedikt. Their work appears in journals such as Lecture notes in computer science, Information and Computation, ACM Transactions on Computational Logic, Logical Methods in Computer Science and Proceedings of the ACM on Programming Languages.
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.