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
Current Page :
Number of result pages: 2
Number of documents: 19


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI