Curriculum Vitae. Michał Skrzypczak. room 4058, LIAFA, Sophie Germain building Paris Cedex 13, France

Transcription

1 Curriculum Vitae Michał Skrzypczak Personal Data address room 4058, LIAFA, Sophie Germain building Paris Cedex 13, France birth date 4 October 1986 citizenship www Polish mskrzypczak@mimuw.edu.pl Research Interest CS Math Automata theory, Model checking Set-theoretic topology, Logic, Games Education 2014 PhD in Computer Science (with honours), University of Warsaw 2012 MSc in Computer Science (with honours), University of Warsaw 2010 MSc in Mathematics (with honours), University of Warsaw University of Warsaw, Faculty of Mathematics, Informatics and Mechanics, Third Degree Program in Computer Science University of Warsaw, Faculty of Mathematics, Informatics and Mechanics, Double Degree Program in Computer Science and Mathematics XIV Secondary School in Warsaw, Mathematical-Experimental Program Visits V 2014 III 2013 XII 2012 II VI 2012 III 2011 Laboratoire Bordelais de Recherche en Informatique, France Laboratoire Bordelais de Recherche en Informatique, France Tel Aviv University, Israel (COST framework) Laboratoire Bordelais de Recherche en Informatique, France Université de Lausanne, Switzerland (GAMES project)

2 Participation in research projects Hierarchy-type problems for automata on infinite words and trees, grant NCN Preludium, leadership Games, Automata and Logic s Extensions, ERC Starting Grant GALE nr , executor Granice rozstrzygalności w teorii automatow, grant NCN 2012/07/D/ST6/02443, subcontractor Nowe modele automatów, grant NCN N N , subcontractor 2014 The Expressiveness of Modal Fixpoint Logics, grant HOMING PLUS/2012-5/1, subcontractor Expressive power of tree logics, ERC Starting Grant Sosna nr , executor 2010 Zaawansowane problemy teorii automatów, grant MNiSW N /0810, subcontractor Honours 2015 EATCS Distinguished Dissertation Award for PhD thesis Descriptive set theoretic methods in automata theory Leadership of a grant Preludium Hierarchy type Problems for Automata on Infinite Words and Trees, donated by National Science Centre 2013/2014 Scholarship Doktoraty dla Mazowsza II for the best PhD students of University of Warsaw 2010/2011 Polish Ministry of Science and Higher Education scholarship for exceptional academic achievements 2009/2010 Polish Ministry of Science and Higher Education scholarship for exceptional academic achievements th Vojtech Jarnik Annual International Mathematical Competition, Ostrava, Czech Republic, 25th position in the overall ranking of 76 participants th International Mathematics Competition, Budapest, Hungary, second prize 2008/2009 Polish Ministry of Science and Higher Education scholarship for exceptional academic achievements 2007 ImagineCup online competition, reaching half-finals in the category Algorithm th International Mathematics Competition, Blagoevgrad, Bulgary, second prize th Vojtech Jarnik Annual International Mathematical Competition, Ostrava, Czech Republic, 15th position in the overall ranking of 50 participants

3 Journal papers 1. Tomasz Idziaszek, Michał Skrzypczak, Mikołaj Bojańczyk, Regular languages of thin trees. Accepted to Theory of Computing Systems, DOI: /s z 2. Olivier Finkel, Michał Skrzypczak, On the Topological Complexity of omega-languages of Non- Deterministic Petri Nets. Information Processing Letters 114(5): , Michał Skrzypczak, Separation property for ωb and ωs-regular languages. Logical Methods in Computer Science 10(1): 1 20, Michał Skrzypczak, Topological extension of parity automata. Information & Computation 228: 16 27, Szczepan Hummel, Michał Skrzypczak, The topological complexity of MSO+U and related automata models. Fundamenta Informaticae, 119(1): , Mikołaj Bojańczyk, Damian Niwiński, Alexander Rabinovich, Adam Radziwończyk-Syta, Michał Skrzypczak, On the borel complexity of MSO definable sets of branches. Fundamenta Informaticae, 98(4): , 2010 Conference papers 1. Mikołaj Bojańczyk, Tomasz Gogacz, Henryk Michalewski, Michał Skrzypczak, On the Decidability of MSO+U on Infinite Trees. In the series Springer-Verlag LNCS, International Colloquium on Automata, Languages, and Programming (ICALP) (2): 50 61, Tomasz Gogacz, Henryk Michalewski, Matteo Mio, Michał Skrzypczak, Measure Properties of Game Tree Languages. In the series Springer-Verlag LNCS, Mathematical Foundations of Computer Science (MFCS) (1): , Marcin Bilkowski, Michał Skrzypczak, Unambiguity and uniformization problems on infinite trees. In the series LIPIcs, Computer Science Logic 2013: , Udi Boker, Denis Kuperberg, Orna Kupferman, Michał Skrzypczak, Nondeterminism in the Presence of a Diverse or Unknown Future. In the series Springer-Verlag LNCS, Internatinal Symposium on Automata, Logic, and Programming: , Alessandro Facchini, Filip Murlak, Michał Skrzypczak, Rabin Mostowski index problem: a step beyond deterministic automata. In the series IEEE Computer Society, Logic in Computer Science 2013: , 2013

4 6. Mikołaj Bojańczyk, Tomasz Idziaszek, Michał Skrzypczak, Regular languages of thin trees. In the series LIPIcs, International Symposium on Theoretical Aspects of Computer Science (STACS): , Michał Skrzypczak, Topological properties of infinite computations. In the brochure from the XIII International Young Mathematicians Workshop: , 2011, ISBN-13: Szczepan Hummel, Michał Skrzypczak, Szymon Toruńczyk, On the topological complexity of MSO+U and related automata models. In the series Springer-Verlag LNCS, Mathematical Foundations of Computer Science (MFCS): , 2010 Professional Experience 2015 PostDoc, Liafa, Université Denis Diderot Paris Scientific assistant, Institute of Informatics, University of Warsaw Teaching assistant (Automata on Infinite Trees), Institute of Informatics, University of Warsaw Teaching assistant (Foundations of Mathematics), Institute of Informatics, University of Warsaw Teaching assistant (Program Semantics and Verification), Institute of Informatics, University of Warsaw Design, development, and deployment of a system of storehouse and sales reports for Travellers Shop IX X 2009 Programmers internship in e-point, development and deployment of a prototype of application supporting Getting Things Done methodology Workshop and Conference Talks 1. On uniformisation in MSO over infinite trees, 30 March 2015, Paris, France, talk at the annual meeting ALGA On determinisation of Good-for-Games automata, 5 September 2014, Paris, France, talk at the conference Highlights of Logic, Games, and Automata Measure Properties of Game Tree Languages, 28 August 2014, Budapest, Hungary, talk at the conference MFCS 2014

5 4. On the decidability of MSO+U on infinite trees, 8 July 2014, Copenhagen, Denmark, talk at the conference ICALP Złożoność deskryptywna a rozstrzygalność logiki MSO i jej rozszerzeń, 28 September 2013, Łowicz, Poland, invited lecture at XIV Logic Workshop 6. Complexity collapse for unambiguous languages, 21 September 2013, Paris, France, talk at the conference Highlights of Logic, Games, and Automata Nondeterminism in the Presence of a Diverse or Unknown Future, 8 July 2013, Riga, Latvia, talk at the conference ICALP Rabin-Mostowski index problem: a step beyond deterministic automata, 28 April 2013, New Orleans, USA, talk at the conference LICS Descriptive complexity vs. decidability for Monadic Second-Order logic, 25 April 2013, Paris, France, invited talk during Journées d Informatique Fondamentale 10. Regular languages of thin trees, 2 March 2013, Kiel, Germany, talk at the conference STACS Regular languages of thin trees, 11 September 2012, Napoli, Italy, talk at Games for Design and Verification workshop 12. MSO+U describes sets at arbitrarily high levels of the projective hierarchy, 1 September 2011, Paris, France, talk at Games for Design and Verification workshop 13. Equational theories of profinite structures, 23 August 2011, Warsaw, Poland, talk at Young Researchers Forum during the conference Mathematical Foundations of Computer Science Złożoność topologiczna logiki MSO+U, 9 April 2011, Gdańsk, Poland, talk at XXV Forum of Theoretical Computer Science 15. Topological properties of infinite computations, 22 September 2010, Kraków, Poland, talk at XIII International Young Mathematicians Workshop 16. Topologia a logika - języki definiowalne w MSO+U, 29 June 2010, Poronin, Poland, talk at XI Logic Workshop 17. O kolorowaniach drzewa Cantora, 22 April 2010, Zakopane, Poland, talk at XXIV Forum of Theoretical Computer Science 18. Topological Complexity of MSO-definable Structures, 17 February 2010, Raach, Austria, discussion ran during Young Set Theory Workshop 2010

6 19. Topologia zbioru Cantora, a obwody logiczne, 1 July 2009, Poronin, Poland, talk at X Logic Workshop 20. Obwody logiczne a zbiory borelowskie, 7 March 2009, Przesieka, Poland, talk at the workshop ZOSIA Dlaczego Hipoteza Riemanna jest równoważna nierówności Lagariasa, 5 June 2007, Warsaw, Poland, talk at the session Functions zeta at the seminar of algebraic geometry of Polish Academy of Sciences