Powrót do listy instytutów
Publikacje
Henryk Michalewski
Liczba publikacji: 372021
- Sebastian Jaszczur , Aakanksha Chowdhery, Afroz Mohiuddin, Lukasz Kaiser, Wojciech Gajewski, Henryk Michalewski , Jonni Kanerva, Sparse is Enough in Scaling Transformers, Thirty-fifth Conference on Neural Information Processing Systems, Online, the United States of America, 7 grudnia 2021 - 10 grudnia 2021. Zobacz w PBN
2019
- Leszek Kołodziejczyk , Henryk Michalewski , Pierre Pradic, Michał Skrzypczak , The logical strength of Büchi's decidability theorem, Logical Methods in Computer Science, 15 (2) 2019, s. 16:1-16:31. Zobacz w PBN
2018
- Sean Carroll, Jiale Chen, Zhibo Chen, Scott Delp, Jennifer Hicks, Zhewei Huang, Piotr Jarosik, Łukasz Kidziński, Sergey Kolesnikov, Sergey Levine, Zhihui Lin, Andrew Melnik, Henryk Michalewski , Piotr Miłoś , Sharada Mohanty, Carmichael Ong, Błażej Osiński, Mikhail Pavlov, Anton Pechenko, Sergey Plis, Helge Ritter, Marcel Salathé, Malte Schilling, Jun Shi, Adam Stelmaszczyk, Chun Yuan, Zhizheng Zhang, Zhuobin Zheng, Shuchang Zhou, Learning to Run Challenge Solutions: Adapting Reinforcement Learning Methods for Neuromusculoskeletal Environments, NIPS 2017 Competition Track, 2018, s. 121-153. Zobacz w PBN
- Matteo Mio, Michał Skrzypczak , Henryk Michalewski , Monadic Second Order Logic with Measure and Category Quantifiers, Logical Methods in Computer Science, 14 (2) 2018, s. 2:1-2:29. Zobacz w PBN
- Henryk Michalewski , Michał Skrzypczak , On the Strength of Unambiguous Tree Automata, International Journal of Foundations of Computer Science, 29 (5) 2018, s. 911-933. Zobacz w PBN
2017
- Damian Niwiński , Henryk Michalewski , Wojciech Rytter , Joost Winter, Michał Skrzypczak , Szymon Toruńczyk , Michał Pilipczuk , Eryk Kopczyński , Sławomir Lasota , Paweł Parys , Joanna Ochremiak, Wojciech Czerwiński , Bartosz Klin , Igor Walukiewicz, Szczepan Hummel, Mikołaj Bojańczyk , Piotr Hofman , Lorenzo Clemente , Filip Mazowiecki, Filip Murlak , 200 Problems in Formal Languages and Automata Theory, 2017. Zobacz w PBN
- Filippo Cavallari, Henryk Michalewski , Michał Skrzypczak , A Characterisation of Pi^0_2 Regular Tree Languages, 42nd International Symposium on Mathematical Foundations of Computer Science, Aalborg, Denmark, 21 sierpnia 2017 - 25 sierpnia 2017. Zobacz w PBN
- Maciej Klimek, Henryk Michalewski , Piotr Miłoś , Hierarchical Reinforcement Learning with Parameters, 1st Annual Conference on Robot Learning, 2017. Zobacz w PBN
- Tomasz Gogacz, Matteo Mio, Michał Skrzypczak , Henryk Michalewski , Measure properties of regular sets of trees, Information and Computation, 256 2017, s. 108-130. Zobacz w PBN
2016
- Henryk Michalewski , Andrzej Nagórko , Jakub Pawlewicz , 485 – A New Upper Bound for Morpion Solitaire, Fourth Workshop on Computer Games, CGW 2015, Held in Conjunction with the 24th International Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 26-27, 2015., Buenos Aires, Argentina, 26 lipca 2015 - 27 lipca 2016. Zobacz w PBN
- Henryk Michalewski , Andrzej Nagórko , Jakub Pawlewicz , An upper bound of 84 for Morpion Solitaire 5D, 28th Canadian Conference on Computational Geometry, Vancouver, Canada, 3 sierpnia 2016 - 5 sierpnia 2016. Zobacz w PBN
- Leszek Kołodziejczyk , Henryk Michalewski , How unprovable is Rabin's decidability theorem?, LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, Nowy Jork, the United States of America, 5 lipca 2016 - 8 lipca 2016. Zobacz w PBN
- Henryk Michalewski , Jakub Sygnowski, Learning from the Memory of Atari 2600, Fifth Workshop on Computer Games, CGW 2016, Held in Conjunction with the 25th International Conference on Artificial Intelligence, IJCAI 2016; New York, 2016., New York, the United States of America, 9 lipca 2016 - 10 lipca 2016. Zobacz w PBN
- Henryk Michalewski , Matteo Mio, Measure Quantifier in Monadic Second Order Logic, 2016. Zobacz w PBN
- Oskar Skibski , Henryk Michalewski , Andrzej Nagórko , Tomasz Michalak , Andrew Dowell, Talal Rahwan, Michael Wooldridge, Non-Utilitarian Coalition Structure Generation, 2016 European Conference on Artificial Intelligence, Hague, the Netherlands, 29 sierpnia 2016 - 2 września 2016. Zobacz w PBN
- Mikołaj Bojańczyk , Henryk Michalewski , Matteo Mio, On the Regular Emptiness Problem of Subzero Automata, 2016. Zobacz w PBN
- Leszek Kołodziejczyk , Henryk Michalewski , Pierre Pradic, Michał Skrzypczak , The logical strength of Büchi's decidability theorem, 25th EACSL Annual Conference on Computer Science Logic, Marsylia, France, 29 sierpnia 2016 - 1 września 2016. Zobacz w PBN
- Henryk Michalewski , Michał Skrzypczak , Unambiguous Büchi Is Weak, Developments in Language Theory, Montreal, Canada, 2016. Zobacz w PBN
2015
- Henryk Michalewski , Matteo Mio, Baire Category Quantifier in Monadic Second Order Logic, Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, 2015. Zobacz w PBN
- Henryk Michalewski , Matteo Mio, On the Problem of Computing the Probability of Regular Sets of Trees, 2015. Zobacz w PBN
2014
- Alessandro Facchini, Henryk Michalewski , Deciding the Borel Complexity of Regular Tree Languages, 2014. Zobacz w PBN
- Tomasz Gogacz, Henryk Michalewski , Matteo Mio, Michał Skrzypczak , Measure Properties of Game Tree Languages, Mathematical Foundations of Computer Science 2014 - 39th International Symposium, Budapest, Hungary, 25 sierpnia 2014 - 29 sierpnia 2014. Zobacz w PBN
- Mikołaj Bojańczyk , Tomasz Gogacz, Henryk Michalewski , Michał Skrzypczak , On the Decidability of MSO+U on Infinite Trees, International Colloquium on Automata, Languages and Programming, 2014. Zobacz w PBN
2013
- André Arnold, Henryk Michalewski , Damian Niwiński , On the Separation Question for Tree Languages, Theory of Computing Systems, 2013. Zobacz w PBN
2012
- Andre Arnold, Henryk Michalewski , Damian Niwiński , On the separation question for tree languages, 2012. Zobacz w PBN
- Henryk Michalewski , Damian Niwiński , On Topological Completeness of Regular Tree Languages, Lecture Notes in Computer Science, 2012. Zobacz w PBN
2011
- Menachem Kojman, Henryk Michalewski , Borel extensions of Baire measures in ZFC, Fundamenta Mathematicae, 2011. Zobacz w PBN
2010
- Andrzej Komisarski, Henryk Michalewski , Functions equivalent to Borel measurable ones, Bulletin of the Polish Academy of Sciences. Mathematics, 2010. Zobacz w PBN
2009
- Szczepan Hummel, Henryk Michalewski , Damian Niwiński , On the Borel inseparability of game tree languages, 2009. Zobacz w PBN
- Adam Krawczyk, Witold Marciszewski , Henryk Michalewski , Remarks on the set of Gδ-points in Eberlein and Corson compact spaces, Topology and its Applications, 2009. Zobacz w PBN
2006
- Wiesław Kubiś, Henryk Michalewski , Small Valdivia compact spaces, Topology and its Applications, 2006. Zobacz w PBN
2003
- Adam Krawczyk, Henryk Michalewski , An example of a topological group, Topology and its Applications, 2003. Zobacz w PBN
- Henryk Michalewski , Condensations of projective sets onto compacta, Proceedings of the American Mathematical Society, 2003. Zobacz w PBN
2001
- Henryk Michalewski , An answer to a question of Arhangel'skii, Commentationes Mathematicae Universitatis Carolinae, 2001. Zobacz w PBN
2000
- Henryk Michalewski , Homogeneity of $\scr K(\bold Q)$, Tsukuba Journal of Mathematics, 2000. Zobacz w PBN
1998
- Henryk Michalewski , Game-theoretic approach to the hereditary Baire property of Cp(Nf), Bulletin of the Polish Academy of Sciences. Mathematics, 1998. Zobacz w PBN
1995
- Henryk Michalewski , Roman Pol , On a Hurewicz-type theorem and a selection theorem of Michael, Bulletin of the Polish Academy of Sciences. Mathematics, 1995. Zobacz w PBN