| 2026 | KR | Partially Finite Model Reasoning in Description Logics. | Tomasz Gogacz, Filip Murlak, Marcin Przybylko, Alexandra Rogova, Michal Skrzypczak |
| 2026 | LICS | Checking History Determinism for Parity Automata Is in NP. | Karoliina Lehtinen, Keya Prakash, Michal Skrzypczak |
| 2026 | STACS | Generalised Quantifiers Based on Rabin-Mostowski Index. | Denis Kuperberg, Damian Niwinski, Pawel Parys, Michal Skrzypczak |
| 2025 | STACS | A Dichotomy Theorem for Ordinal Ranks in MSO. | Damian Niwinski, Pawel Parys, Michal Skrzypczak |
| 2024 | LICS | Uniformisation of Regular Relations in First-Order Logic with Two Variables. | Nathan Lhote, Vincent Michielini, Michal Skrzypczak |
| 2024 | STACS | Positionality in Σ⁰₂ and a Completeness Result. | Pierre Ohlmann, Michal Skrzypczak |
| 2023 | LICS | The Probabilistic Rabin Tree Theorem | Damian Niwinski, Pawel Parys, Michal Skrzypczak |
| 2021 | ICALP | Deterministic and Game Separability for Regular Languages of Infinite Trees. | Lorenzo Clemente, Michal Skrzypczak |
| 2021 | MFCS | On Guidable Index of Tree Automata. | Damian Niwinski, Michal Skrzypczak |
| 2020 | ICALP | Computing Measures of Weak-MSO Definable Sets of Trees. | Damian Niwinski, Marcin Przybylko, Michal Skrzypczak |
| 2020 | LICS | Uniformisations of Regular Relations Over Bi-Infinite Words. | Grzegorz Fabianski, Michal Skrzypczak, Szymon Torunczyk |
| 2020 | MFCS | Regular Choice Functions and Uniformisations For countable Domains. | Vincent Michielini, Michal Skrzypczak |
| 2019 | LICS | MSO+∇ is undecidable. | Mikolaj Bojanczyk, Edon Kelmendi, Michal Skrzypczak |
| 2019 | MFCS | Uniformisation Gives the Full Strength of Regular Languages. | Nathan Lhote, Vincent Michielini, Michal Skrzypczak |
| 2018 | ICALP | Unambiguous Languages Exhaust the Index Hierarchy. | Michal Skrzypczak |
| 2017 | DLT | Connecting Decidability and Complexity for MSO Logic. | Michal Skrzypczak |
| 2017 | MFCS | A Characterisation of Pi^0_2 Regular Tree Languages. | Filippo Cavallari, Henryk Michalewski, Michal Skrzypczak |
| 2016 | CSL | The Logical Strength of Bchi's Decidability Theorem. | Leszek Aleksander Kolodziejczyk, Henryk Michalewski, Ccilia Pradic, Michal Skrzypczak |
| 2016 | DLT | Unambiguous Bchi Is Weak. | Henryk Michalewski, Michal Skrzypczak |
| 2016 | ICALP | Deciding the Topological Complexity of Bchi Languages. | Michal Skrzypczak, Igor Walukiewicz |
| 2016 | MFCS | On the Complexity of Branching Games with Regular Conditions. | Marcin Przybylko, Michal Skrzypczak |
| 2015 | ICALP | Trading Bounds for Memory in Games with Counters. | Nathanal Fijalkow, Florian Horn, Denis Kuperberg, Michal Skrzypczak |
| 2015 | ICALP | On Determinisation of Good-for-Games Automata. | Denis Kuperberg, Michal Skrzypczak |
| 2015 | WoLLIC | On the Weak Index Problem for Game Automata. | Alessandro Facchini, Filip Murlak, Michal Skrzypczak |
| 2014 | ICALP | On the Decidability of MSO+U on Infinite Trees. | Mikolaj Bojanczyk, Tomasz Gogacz, Henryk Michalewski, Michal Skrzypczak |
| 2014 | MFCS | Measure Properties of Game Tree Languages. | Tomasz Gogacz, Henryk Michalewski, Matteo Mio, Michal Skrzypczak |
| 2013 | CSL | Unambiguity and uniformization problems on infinite trees. | Marcin Bilkowski, Michal Skrzypczak |
| 2013 | ICALP | Nondeterminism in the Presence of a Diverse or Unknown Future. | Udi Boker, Denis Kuperberg, Orna Kupferman, Michal Skrzypczak |
| 2013 | LICS | Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata. | Alessandro Facchini, Filip Murlak, Michal Skrzypczak |
| 2013 | STACS | Regular languages of thin trees. | Mikolaj Bojanczyk, Tomasz Idziaszek, Michal Skrzypczak |
| 2010 | MFCS | On the Topological Complexity of MSO+U and Related Automata Models. | Szczepan Hummel, Michal Skrzypczak, Szymon Torunczyk |