World's Best Scientists 2026 revealed!
Antonín Kučera

Antonín Kučera

D-Index & Metrics

Computer Science

D-Index
34
Citations
3936
World Ranking
12299
National Ranking
28

Overview

Antonín Kučera is affiliated with Masaryk University in the Czech Republic. Their research primarily falls within the field of Computer Science, with a focus on several subfields including Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Software, and Computer Vision and Pattern Recognition.

The scientist's main topics of work highlight a wide range of areas within computer science:

  • Formal Methods in Verification
  • Logic, programming, and type systems
  • Optimization and Search Problems
  • Robotic Path Planning Algorithms
  • Distributed systems and fault tolerance
  • Petri Nets in System Modeling
  • Software Testing and Debugging Techniques

Antonín Kučera's recent publications include these papers:

  • "The satisfiability problem for a quantitative fragment of PCTL," 2023, Journal of Computer and System Sciences
  • "Regstar: Efficient Strategy Synthesis for Adversarial Patrolling Games," 2021, arXiv (Cornell University)
  • "General Optimization Framework for Recurrent Reachability Objectives," 2022, Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence
  • "Asymptotic Complexity Estimates for Probabilistic Programs and Their VASS Abstractions," 2023, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • "On-the-fly Adaptation of Patrolling Strategies in Changing Environments," 2022, arXiv (Cornell University)

The scientist has frequently published in several venues, indicating a consistent contribution to conference proceedings and preprint archives:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Journal of Computer and System Sciences
  • Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence

Antonín Kučera often collaborates with other researchers. Their most frequent co-authors include:

  • David Klaška
  • Vít Musil
  • Vojtěch Řehák
  • Miroslav Chodil
  • Vojtěch Kůr

Best Publications

  • Model Checking Probabilistic Pushdown Automata

    Antonín Kucera;Javier Esparza;Richard Mayr

  • Model checking LTL with regular valuations for pushdown systems

    Javier Esparza;Antonín Kucera;Stefan Schwoon

  • Model checking probabilistic pushdown automata

    J. Esparza;A. Kucera;R. Mayr

  • Randomness and Recursive Enumerability

    Antonín Kucera;T. Slaman

  • Measure, Π10-classes and complete extensions of PA

    Antonín Kučera

  • Model-Checking LTL with Regular Valuations for Pushdown Systems

    Unknown

  • Deciding bisimulation-like equivalences with finite-state processes

    Petr Jančar;Antonin Kučera;Richard Mayr

  • Reachability games on extended vector addition systems with states

    Tomáš Brázdil;Petr Jančar;Antonín Kučera

  • An alternative, priority-free, solution to Post's problem

    Antonín Kucera

  • Mathematical Foundations of Computer Science 2010

    Petr Hliněný;Antonín Kučera

  • On the decidability of temporal properties of probabilistic pushdown automata

    Tomáš Brázdil;Antonín Kučera;Oldřich Stražovský

  • Lowness for the class of random sets

    Antonín Kučera;Sebastiaan A. Terwijn

  • Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes

    Tomás Brázdil;Václav Brozek;Krishnendu Chatterjee;Vojtech Forejt

  • Quantitative analysis of probabilistic pushdown automata: expectations and variances

    J. Esparza;A. Kucera;R. Mayr

  • Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes

    Tomáš Brázdil;Václav Brožek;Krishnendu Chatterjee;Vojtěch Forejt

  • Equivalence-checking on infinite-state systems: Techniques and results

    Antonín Kučera;Petr Jančar

  • One-counter Markov decision processes

    T. Brázdil;V. Brožek;K. Etessami;A. Kučera

  • The Satisfiability Problem for Probabilistic CTL

    T. Brazdil;V. Forejt;J. Kretinsky;A. Kucera

  • Stochastic games with branching-time winning objectives

    T. Brazdil;V. Brozek;V. Forejt;A. Kucera

  • Markov Decision Processes with Multiple Long-run Average Objectives

    Tomáš Brázdil;Václav Brožek;Krishnendu Chatterjee;Vojtěch Forejt

  • Efficient controller synthesis for consumption games with multiple resource types

    Tomáš Brázdil;Krishnendu Chatterjee;Antonín Kučera;Petr Novotný

  • Model Checking Probabilistic Pushdown Automata

    Javier Esparza;Antonin Kucera;Richard Mayr

Frequent Co-Authors

Krishnendu Chatterjee
Krishnendu Chatterjee Institute of Science and Technology Austria
Javier Esparza
Javier Esparza Technical University of Munich
Christel Baier
Christel Baier TU Dresden
Kousha Etessami
Kousha Etessami University of Edinburgh
Catuscia Palamidessi
Catuscia Palamidessi French Institute for Research in Computer Science and Automation - INRIA
Peter Bro Miltersen
Peter Bro Miltersen Aarhus University
Mogens Nielsen
Mogens Nielsen Aarhus University
Joost-Pieter Katoen
Joost-Pieter Katoen RWTH Aachen University
Rodney G. Downey
Rodney G. Downey Victoria University of Wellington
Paul M. B. Vitányi
Paul M. B. Vitányi Centrum Wiskunde & Informatica

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring a career in computer science opens up diverse options, both in terms of educational pathways and future jobs. If you’re aiming to fast-track your studies while saving on tuition, consider cheap online degrees fast to earn your qualification efficiently and affordably.

Not everyone enters college with a stellar academic record, but opportunities remain accessible. Some institutions offer flexible admissions, including college with low gpa to help students who might not meet traditional requirements get started on their paths.

Career possibilities span far beyond pure programming. For instance, the analytical and problem-solving skills from computer science can translate into tech roles in other fields, like environmental science. Explore jobs for environmental science majors to broaden your understanding of interdisciplinary options.

Students looking to quickly prepare for in-demand technology careers should check out computer science accelerated program opportunities. These intensive online pathways help you build real-world skills in less time, so you can join the workforce sooner.

Best Scientists Citing Antonín Kučera

Trending Scientists

Recently Published Articles