Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publikacje
Henryk Michalewski
2018
- 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
- Łukasz Kidziński, Sharada Mohanty, Carmichael Ong, Zhewei Huang, Shuchang Zhou, Anton Pechenko, Adam Stelmaszczyk, Piotr Jarosik, Mikhail Pavlov, Sergey Kolesnikov, Sergey Plis, Zhibo Chen, Zhizheng Zhang, Jiale Chen, Jun Shi, Zhuobin Zheng, Chun Yuan, Zhihui Lin, Henryk Michalewski, Piotr Miłoś, Błażej Osiński, Andrew Melnik, Malte Schilling, Helge Ritter, Sean Carroll, Jennifer Hicks, Sergey Levine, Marcel Salathé i Scott Delp, Learning to Run Challenge Solutions: Adapting Reinforcement Learning Methods for Neuromusculoskeletal Environments, w: The NIPS '17 Competition: Building Intelligent Systems, USA 2018, s. 121–153.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
- Maciej Klimek, Henryk Michalewski i Piotr Miłoś, Hierarchical Reinforcement Learning with Parameters, Journal Of Machine Learning Research 78 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
- Henryk Michalewski, Andrzej Nagórko i Jakub Pawlewicz, An upper bound of 84 for Morpion Solitaire 5D, w: Proceedings of the 28th Canadian Conference on Computational Geometry, CCCG 2016, August 3-5, 2016, Simon Fraser University, Vancouver, British Columbia, Canada, Simon Fraser University, Vancouver, British Columbia, Canada 2017, s. 270–278.zobacz w PBN
- Maciej Klimek, Henryk Michalewski i Piotr Miłoś, Hierarchical Reinforcement Learning with Parameters, w: 1st Annual Conference on Robot Learning, CoRL 2017, Mountain View, California, USA, November 13-15, 2017, Proceedings, 2017, s. 301–313.zobacz w PBN
2016
- Henryk Michalewski i Matteo Mio, Measure Quantifier in Monadic Second Order Logic, w: Logical Foundations of Computer Science - International Symposium, LFCS 2016, Deerfield Beach, FL, USA, January 4-7, 2016. Proceedings, 2016, s. 267–282.zobacz w PBN
- Henryk Michalewski, Andrzej Nagórko i Jakub Pawlewicz, 485 – A New Upper Bound for Morpion Solitaire, w: Computer Games, Springer International Publishing, 2016, s. 44–59.zobacz w PBN
- Oskar Skibski, Henryk Michalewski, Andrzej Nagórko, Tomasz Michalak, Andrew Dowell, Talal Rahwan i Michael Wooldridge, Non-Utilitarian Coalition Structure Generation, w: Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI 2016), 2016, s. 1738–1739.zobacz w PBN
- Leszek Aleksander Kołodziejczyk i Henryk Michalewski, How unprovable is Rabin's decidability theorem?, w: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016, 2016, s. 788–797.zobacz w PBN
- 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
- Henryk Michalewski, Matteo Mio i Mikołaj Bojańczyk, On the Regular Emptiness Problem of Subzero Automata, w: Proceedings 9th Interaction and Concurrency Experience, ICE 2016, Heraklion, Greece, 8-9 June 2016., 2016, s. 1–23.zobacz w PBN
- Jakub Sygnowski i Henryk Michalewski, Learning from the Memory of Atari 2600, w: Computer Games, Springer International Publishing, 2016.zobacz w PBN
2015
- Henryk Michalewski i Matteo Mio, On the Problem of Computing the Probability of Regular Sets of Trees, w: 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2015, December 16-18, 2015, Bangalore, India, 2015, s. 489–502.zobacz w PBN
- Henryk Michalewski i Matteo Mio, Baire Category Quantifier in Monadic Second Order Logic, w: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, Springer, 2015, s. 362–374.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
- Alessandro Facchini i Henryk Michalewski, Deciding the Borel Complexity of Regular Tree Languages, w: Language, Life, Limits - 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings, Springer, 2014, s. 163–172.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
2009
- Szczepan Hummel, Henryk Michalewski i Damian Niwiński, On the Borel inseparability of game tree languages, w: 26th International Symposium on Theoretical Aspects of Computer Science, Freiburg, February 26 - 28, 2009, Leibniz-Zentrum fuer Informatik, Schloss Dagstuhl 2009.zobacz w PBN
- Adam Krawczyk, Witold Marciszewski i Henryk Michalewski, Remarks on the set of Gδ-points in Eberlein and Corson compact spaces, Topology And Its Applications 156 2009, s. 1746–1748.zobacz w PBN
Nie jesteś zalogowany | zaloguj się
