Minimality problems for promise versions of finite automata. - Michal Ajdarów (NCMA, 2017)

Deciding Polynomial Termination Complexity for VASS Programs. - Michal Ajdarów; Antonín Kucera 001 (CONCUR, 2021)

Shielding in Resource-Constrained Goal POMDPs. - Michal Ajdarów; Simon Brlej; Petr Novotný 001 (AAAI, 2023)

Asymptotic Complexity Estimates for Probabilistic Programs and Their VASS Abstractions. - Michal Ajdarów; Antonín Kucera 001 (CONCUR, 2023)

Asymptotic Analysis of Probabilistic Programs: When Expectations Do Not Meet Our Expectations. - Michal Ajdarów; Antonín Kucera 001; Petr Novotný 001 (Principles of Verification (1), 2024)

Taming Infinity One Chunk at a Time: Concisely Represented Strategies in One-Counter MDPs. - Michal Ajdarów; James C. A. Main; Petr Novotný 001; Mickael Randour (ICALP, 2025)

Efficient Analysis of Polynomial Asymptotic Estimates for VASS MDPs. - Michal Ajdarów (CoRR, 2025)