Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publikacje
Michał Skrzypczak
2018
- Udi Boker, Orna Kupferman i Michał Paweł Skrzypczak, How Deterministic are Good-For-Games Automata?, w: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017, December 11-15, 2017, Kanpur, India, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, r. 18, s. 18:1–18:14.zobacz w PBN
- Michał Paweł Skrzypczak, B\üchi VASS Recognise \(\sum\)\(^\mbox1\)\(_\mbox1\)-complete \(ω\)-languages, w: Reachability Problems - 12th International Conference, RP 2018, Marseille, France, September 24-26, 2018, Proceedings, Springer, 2018, s. 133–145.zobacz w PBN
- Michał Paweł Skrzypczak, Unambiguous Languages Exhaust the Index Hierarchy, w: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, 2018, r. 140, s. 140:1–140:14.zobacz w PBN
- Matteo Mio, Michał Paweł Skrzypczak i Henryk Michalewski, Monadic Second Order Logic with Measure and Category Quantifiers, Logical Methods In Computer Science 14 (2) 2018.zobacz w PBN
- Henryk Michalewski i Michał Paweł Skrzypczak, On the Strength of Unambiguous Tree Automata, International Journal Of Foundations Of Computer Science 29 (5) 2018.zobacz w PBN
2017
- Mikołaj Bojańczyk, Wojciech Czerwiński, Piotr Hofman, Szczepan Hummel, Bartosz Klin, Eryk Kopczyński, Sławomir Lasota, Filip Aleksander Mazowiecki, Henryk Michalewski, Damian Niwiński, Joanna Ochremiak, Paweł Parys, Michał Pilipczuk, Wojciech Rytter, Michał Paweł Skrzypczak, Szymon Toruńczyk, Igor Walukiewicz, Joost Winter i Lorenzo ClementeFilip Murlak (red.), 200 Problems in Formal Languages and Automata Theory, Uniwersytet Warszawski, Warszawa 2017.zobacz w PBN
- Filippo Cavallari, Henryk Michalewski i Michał Paweł Skrzypczak, A Characterisation of Pi\^0\_2 Regular Tree Languages, w: 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017, s. 56:1–56:14.zobacz w PBN
- Michał Paweł Skrzypczak, Connecting Decidability and Complexity for MSO Logic, w: Developments in Language Theory - 21st International Conference, DLT 2017, Li\`ege, Belgium, August 7-11, 2017, Proceedings, Springer, 2017, s. 75–79.zobacz w PBN
- Tomasz Gogacz, Henryk Michalewski, Matteo Mio i Michał Paweł Skrzypczak, Measure properties of regular sets of trees, Information And Computation 256 2017, s. 108–130.zobacz w PBN
2016
- Leszek Aleksander Kołodziejczyk, Henryk Michalewski, Pierre Pradic i Michał Paweł Skrzypczak, The logical strength of Büchi's decidability theorem, w: 25th EACSL Annual Conference on Computer Science Logic (CSL 2016), Schloss Dagstuhl 2016, s. 36:1–36:16.zobacz w PBN
- Henryk Michalewski i Michał Paweł Skrzypczak, Unambiguous Büchi Is Weak, w: Developments in Language Theory - 20th International Conference, DLT 2016, Montr\'eal, Canada, July 25-28, 2016, Proceedings, 2016, s. 319–331.zobacz w PBN
- Michał Paweł Skrzypczak i Igor Walukiewicz, Deciding the Topological Complexity of Büchi Languages, w: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy, 2016, s. 99:1–99:13.zobacz w PBN
- Alessandro Facchini, Filip Murlak i Michał Paweł Skrzypczak, Index Problems for Game Automata, Acm Transactions On Computational Logic 17 (4) 2016, s. 24:1–24:38.zobacz w PBN
- Michał Paweł Skrzypczak, Descriptive Set Theoretic Methods in Automata Theory - Decidability and Topological Complexity, Springer, 2016.zobacz w PBN
- Marcin Przybyłko i Michał Paweł Skrzypczak, On the Complexity of Branching Games with Regular Conditions, w: 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016, s. 78:1–78:14.zobacz w PBN
2015
- Alessandro Facchini, Filip Murlak i Michał Paweł Skrzypczak, On the Weak Index Problem for Game Automata, w: Logic, Language, Information, and Computation - 22nd International Workshop, WoLLIC 2015, Bloomington, IN, USA, July 20-23, 2015, Proceedings, Springer, 2015, s. 93–108.zobacz w PBN
- Denis Kuperberg i Michał Paweł Skrzypczak, On Determinisation of Good-For-Games Automata, w: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, Springer, 2015, s. 299–310.zobacz w PBN
- Nathanael Fijalkow, Florian Horn, Denis Kuperberg i Michał Paweł Skrzypczak, Trading bounds for memory in games with counters, w: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, Springer, 2015, s. 197–208.zobacz w PBN
- Nathanael Fijalkow i Michał Paweł Skrzypczak, Irregular Behaviours for Probabilistic Automata, w: Reachability Problems - 9th International Workshop, {RP} 2015, Warsaw, Poland, September 21-23, 2015, Proceedings, Springer, Warsaw 2015, s. 33–36.zobacz w PBN
- Tomasz Idziaszek, Michał Paweł Skrzypczak i Mikołaj Bojańczyk, Regular languages of thin trees, Theory Of Computing Systems 2015, s. 1–50.zobacz w PBN
2014
- Mikołaj Bojańczyk, Tomasz Gogacz, Henryk Michalewski i Michał Paweł Skrzypczak, On the Decidability of MSO+U on Infinite Trees, w: Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II, 2014, s. 50–61.zobacz w PBN
- Tomasz Gogacz, Henryk Michalewski, Matteo Mio i Michał Paweł Skrzypczak, Measure Properties of Game Tree Languages, w: Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II, Springer, 2014, s. 303–314.zobacz w PBN
- Olivier Finkel i Michał Paweł Skrzypczak, On the Topological Complexity of w-Languages of Non-Deterministic Petri Nets, Information Processing Letters 114 (5) 2014, s. 229–233.zobacz w PBN
- Michał Paweł Skrzypczak, Separation Property for wB- and wS-regular Languages, Logical Methods In Computer Science 10 (1:8) 2014, s. 1–20.zobacz w PBN
2013
- Mikołaj Bojańczyk, Tomasz Idziaszek i Michał Paweł Skrzypczak, Regular languages of thin trees, w: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany 2013, s. 562–573.zobacz w PBN
- Alessandro Facchini, Filip Murlak i Michał Paweł Skrzypczak, Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata, w: Proceedings of LICS 2013, 2013, s. 499–508.zobacz w PBN
- Michał Paweł Skrzypczak, Topological extension of parity automata, Information And Computation 228 2013, s. 16–27.zobacz w PBN
- Marcin Bilkowski, Michał Skrzypczak i Simona Ronchi Della Rocca, Unambiguity and uniformization problems on infinite trees, w: Computer Science Logic 2013 (CSL 2013), 2013, s. 81–100.zobacz w PBN
- Udi Boker, Denis Kuperberg, Orna Kupferman i Michał Paweł Skrzypczak, Nondeterminism in the Presence of a Diverse or Unknown Future, w: ICALP (2), 2013, 2013, s. 89–100.zobacz w PBN
2010
- Szczepan Hummel, Michał Paweł Skrzypczak i Szymon Toruńczyk, On the Topological Complexity of MSO+U and Related Automata Models, w: Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings, Springer, Brno 2010, s. 429–440.zobacz w PBN
- Mikołaj Bojańczyk, Damian Niwiński, Alexander Rabinovich, Adam Radziwonczyk-Syta i Michał Skrzypczak, On the Borel Complexity of MSO Definable Sets of Branches, Fundamenta Informaticae 98 (4) 2010, s. 337–349.zobacz w PBN
Nie jesteś zalogowany | zaloguj się
