| No. |
Title |
Author |
Year |
| 1 |
String-to-String Interpretations With Polynomial-Size Output |
Bojanczyk, Mikolaj et al. |
2019 |
| 2 |
Emptiness of Zero Automata Is Decidable |
Bojanczyk, Mikolaj et al. |
2017 |
| 3 |
Optimizing Tree Decompositions in MSO |
Bojanczyk, Mikolaj et al. |
2017 |
| 4 |
Orbit-Finite Sets and Their Algorithms (Invited Talk) |
Bojanczyk, Mikolaj |
2017 |
| 5 |
Which Classes of Origin Graphs Are Generated by Transducers |
Bojanczyk, Mikolaj et al. |
2017 |
| 6 |
Circuits, Logic and Games (Dagstuhl Seminar 15401) |
Bojanczyk, Mikolaj et al. |
2016 |
| 7 |
Decidable Extensions of MSO (Invited Talk) |
Bojanczyk, Mikolaj |
2016 |
| 8 |
The MSO+U Theory of (N,<) Is Undecidable |
Bojanczyk, Mikolaj et al. |
2016 |
| 9 |
Thin MSO with a Probabilistic Path Quantifier |
Bojanczyk, Mikolaj |
2016 |
| 10 |
Nominal Computation Theory (Dagstuhl Seminar 13422) |
Bojanczyk, Mikolaj et al. |
2014 |
| 11 |
Regular languages of thin trees |
Bojanczyk, Mikolaj et al. |
2013 |
| 12 |
Decidable classes of documents for XPath |
Bárány, Vince et al. |
2012 |
| 13 |
Imperative Programming in Sets with Atoms |
Bojanczyk, Mikolaj et al. |
2012 |
| 14 |
Weak MSO+U over infinite trees |
Bojanczyk, Mikolaj et al. |
2012 |
| 15 |
Data Monoids |
Bojanczyk, Mikolaj |
2011 |
| 16 |
Automata for Data Words and Data Trees |
Bojanczyk, Mikolaj |
2010 |
| 17 |
Beyond omega-Regular Languages |
Bojanczyk, Mikolaj |
2010 |
| 18 |
Deterministic Automata and Extensions of Weak MSO |
Bojanczyk, Mikolaj et al. |
2009 |
| 19 |
Weak MSO with the Unbounding Quantifier |
Bojanczyk, Mikolaj |
2009 |
