Antonı́n Kučera

2.6k total citations
77 papers, 736 citations indexed

About

Antonı́n Kučera is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Software. According to data from OpenAlex, Antonı́n Kučera has authored 77 papers receiving a total of 736 indexed citations (citations by other indexed papers that have themselves been cited), including 49 papers in Computational Theory and Mathematics, 30 papers in Artificial Intelligence and 15 papers in Software. Recurrent topics in Antonı́n Kučera's work include Formal Methods in Verification (48 papers), Petri Nets in System Modeling (21 papers) and Logic, programming, and type systems (18 papers). Antonı́n Kučera is often cited by papers focused on Formal Methods in Verification (48 papers), Petri Nets in System Modeling (21 papers) and Logic, programming, and type systems (18 papers). Antonı́n Kučera collaborates with scholars based in Czechia, United Kingdom and Germany. Antonı́n Kučera's co-authors include Javier Esparza, Richard Mayr, Tomǎš Brázdil, Petr Jančar, Vojtěch Forejt, Stefan Schwoon, Václav Brožek, Stefan Kiefer, Krishnendu Chatterjee and Jan Křetínský and has published in prestigious journals such as Journal of the ACM, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Antonı́n Kučera

75 papers receiving 700 citations

Peers

Antonı́n Kučera
Patricia Bouyer France
Josée Desharnais Canada
Marcin Jurdziński United Kingdom
Jean-François Raskin Belgium
Ryszard Janicki Canada
Roni Rosner Israel
Enrico Giunchiglia Italy
Joël Ouaknine United Kingdom
Ernst Moritz Hahn Germany
Yassine Lakhnech France
Patricia Bouyer France
Antonı́n Kučera
Citations per year, relative to Antonı́n Kučera Antonı́n Kučera (= 1×) peers Patricia Bouyer

Countries citing papers authored by Antonı́n Kučera

Since Specialization
Citations

This map shows the geographic impact of Antonı́n Kučera'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 Antonı́n Kučera with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Antonı́n Kučera more than expected).

Fields of papers citing papers by Antonı́n Kučera

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Antonı́n Kučera. 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 Antonı́n Kučera. The network helps show where Antonı́n Kučera may publish in the future.

Co-authorship network of co-authors of Antonı́n Kučera

This figure shows the co-authorship network connecting the top 25 collaborators of Antonı́n Kučera. A scholar is included among the top collaborators of Antonı́n Kučera based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Antonı́n Kučera. Antonı́n Kučera is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Kučera, Antonı́n, et al.. (2024). The Finite Satisfiability Problem for PCTL is Undecidable. 1–14. 2 indexed citations
2.
Kučera, Antonı́n, et al.. (2023). Synthesizing Resilient Strategies for Infinite-Horizon Objectives in Multi-Agent Systems. Veřejné služby Informačního systému (Masarykiana Brunensis Universitas). 171–179. 1 indexed citations
3.
Kučera, Antonı́n & Richard Mayr. (2017). A generic framework for checking semantic equivalences between pushdown automata and finite-state automata. Journal of Computer and System Sciences. 91. 82–103. 2 indexed citations
4.
Kučera, Antonı́n, et al.. (2016). Regular Strategies and Strategy Improvement: Efficient Tools for Solving Large Patrolling Problems. Adaptive Agents and Multi-Agents Systems. 1171–1179. 3 indexed citations
5.
Fowler, Laura D., et al.. (2015). Spare Change : Evaluating revised forecasts. MAUSAM. 66(3). 635–644. 1 indexed citations
6.
Brázdil, Tomǎš, et al.. (2014). Solving adversarial patrolling games with bounded error: (extended abstract). Adaptive Agents and Multi-Agents Systems. 1617–1618. 2 indexed citations
7.
Brázdil, Tomǎš, Václav Brožek, Krishnendu Chatterjee, Vojtěch Forejt, & Antonı́n Kučera. (2014). Markov Decision Processes with Multiple Long-run Average Objectives. Logical Methods in Computer Science. Volume 10, Issue 1. 13 indexed citations
8.
Kučera, Antonı́n, et al.. (2013). Mathematical and Engineering Methods in Computer Science. Lecture notes in computer science. 1 indexed citations
9.
Brázdil, Tomǎš, Vojtěch Forejt, Jan Krčál, Jan Křetínský, & Antonı́n Kučera. (2013). Continuous-time stochastic games with time-bounded reachability. Information and Computation. 224. 46–70. 8 indexed citations
10.
Brázdil, Tomǎš, Václav Brožek, Antonı́n Kučera, & Jan Óbdržálek. (2011). Qualitative reachability in stochastic BPA games. Information and Computation. 209(8). 1160–1183. 15 indexed citations
11.
Brázdil, Tomǎš, Václav Brožek, Krishnendu Chatterjee, Vojtěch Forejt, & Antonı́n Kučera. (2011). Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. arXiv (Cornell University). 8 indexed citations
12.
13.
Brázdil, Tomǎš, Vojtěch Forejt, Jan Krčál, Jan Křetínský, & Antonı́n Kučera. (2009). Continuous-Time Stochastic Games with Time-Bounded Reachability. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 12 indexed citations
14.
15.
Esparza, Javier, Antonı́n Kučera, & Richard Mayr. (2004). Model checking probabilistic pushdown automata. arXiv (Cornell University). 2. 12–21. 58 indexed citations
16.
Esparza, Javier, Antonı́n Kučera, & Stefan Schwoon. (2003). Model checking LTL with regular valuations for pushdown systems. Information and Computation. 186(2). 355–376. 80 indexed citations
17.
Jančar, Petr, et al.. (2003). DP lower bounds for equivalence-checking and model-checking of one-counter automata. Information and Computation. 188(1). 1–19. 10 indexed citations
18.
Kučera, Antonı́n & Richard Mayr. (2002). Why is simulation harder than bisimulation. 2 indexed citations
19.
Kučera, Antonı́n & Richard Mayr. (2002). Simulation Preorder over Simple Process Algebras. Information and Computation. 173(2). 184–198. 8 indexed citations
20.
Jančar, Petr, Antonı́n Kučera, & Faron Moller. (1999). Simulation and Bisimulation over One-Counter Processes. DSpace VŠB-TUO (VŠB-TUO). 1 indexed citations

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.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Patricia Bouyer Breakdown of academic impact, for papers by Josée Desharnais Breakdown of academic impact, for papers by Marcin Jurdziński Breakdown of academic impact, for papers by Jean-François Raskin Breakdown of academic impact, for papers by Ryszard Janicki Breakdown of academic impact, for papers by Roni Rosner Breakdown of academic impact, for papers by Enrico Giunchiglia Breakdown of academic impact, for papers by Joël Ouaknine Breakdown of academic impact, for papers by Ernst Moritz Hahn Breakdown of academic impact, for papers by Yassine Lakhnech
Rankless by CCL
2026