prof. RNDr. Antonín Kučera, Ph.D.
vedoucí pracoviště – Institut teoretické informatiky
kancelář: C411
Botanická 554/68a
602 00 Brno
| telefon: | 549 49 4374 |
|---|---|
| e‑mail: |
| sociální a akademické sítě: |
|---|
Počet publikací: 161
2026
-
PCTL Satisfiability for Infinite Binary Trees
Principles of Formal Quantitative Analysis : Essays Dedicated to Christel Baier on the Occasion of Her 60th Birthday, rok: 2026
-
The Finite Satisfiability Problem for PCTL is Undecidable
JOURNAL OF THE ACM, rok: 2026, ročník: 73, vydání: 1, DOI
2025
-
Asymptotic Analysis of Probabilistic Programs : When Expectations Do Not Meet Our Expectations
Principles of Verification: Cycling the Probabilistic Landscape : Essays Dedicated to Joost-Pieter Katoen on the Occasion of His 60th Birthday, rok: 2025
-
Multiple Mean-Payoff Optimization Under Local Stability Constraints
Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 39 No. 25: AAAI-25 Technical Tracks 25, rok: 2025
-
Steady-State Strategy Synthesis for Swarms of Autonomous Agents
Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, rok: 2025
-
The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic Are Highly Undecidable
52nd International Colloquium on Automata, Languages, and Programming, rok: 2025
2024
-
Optimizing Local Satisfaction of Long-Run Average Objectives in Markov Decision Processes
Proceedings of 38th Annual AAAI Conference on Artificial Intelligence (AAAI 2024), rok: 2024
-
Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024).
Rok: 2024, druh: Editorství tématického sborníku
-
Taming the Infinities of Concurrency : Essays Dedicated to Javier Esparza on the Occasion of His 60th Birthday
Rok: 2024, druh: Editorství tématického sborníku
-
The Finite Satisfiability Problem for PCTL is Undecidable
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, rok: 2024