Henryk Michalewski

According to our database1, Henryk Michalewski authored at least 33 papers between 2009 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Neural heuristics for SAT solving.
CoRR, 2020

Simulation-Based Reinforcement Learning for Real-World Autonomous Driving.
Proceedings of the 2020 IEEE International Conference on Robotics and Automation, 2020

Model Based Reinforcement Learning for Atari.
Proceedings of the 8th International Conference on Learning Representations, 2020

2019
The logical strength of Büchi's decidability theorem.
Log. Methods Comput. Sci., 2019

Towards Finding Longer Proofs.
CoRR, 2019

Model-Based Reinforcement Learning for Atari.
CoRR, 2019

2018
Monadic Second Order Logic with Measure and Category Quantifiers.
Log. Methods Comput. Sci., 2018

On the Strength of Unambiguous Tree Automata.
Int. J. Found. Comput. Sci., 2018

Expert-augmented actor-critic for ViZDoom and Montezumas Revenge.
CoRR, 2018

Learning to Run challenge solutions: Adapting reinforcement learning methods for neuromusculoskeletal environments.
CoRR, 2018

Distributed Deep Reinforcement Learning: Learn How to Play Atari Games in 21 minutes.
Proceedings of the High Performance Computing - 33rd International Conference, 2018

Reinforcement Learning of Theorem Proving.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017
Measure properties of regular sets of trees.
Inf. Comput., 2017

Some connections between universal algebra and logics for trees.
CoRR, 2017

A Characterisation of Pi^0_2 Regular Tree Languages.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Atari Games and Intel Processors.
Proceedings of the Computer Games - 6th Workshop, 2017

Hierarchical Reinforcement Learning with Parameters.
Proceedings of the 1st Annual Conference on Robot Learning, CoRL 2017, Mountain View, 2017

2016
On the Regular Emptiness Problem of Subzero Automata.
Proceedings of the Proceedings 9th Interaction and Concurrency Experience, 2016

How unprovable is Rabin's decidability theorem?
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Measure Quantifier in Monadic Second Order Logic.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2016

Learning from the Memory of Atari 2600.
Proceedings of the Computer Games - 5th Workshop on Computer Games, 2016

Non-Utilitarian Coalition Structure Generation.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

Unambiguous Büchi Is Weak.
Proceedings of the Developments in Language Theory - 20th International Conference, 2016

An upper bound of 84 for Morpion Solitaire 5D.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015
485 - A New Upper Bound for Morpion Solitaire.
Proceedings of the Computer Games - Fourth Workshop on Computer Games, 2015

Baire Category Quantifier in Monadic Second Order Logic.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

On the Problem of Computing the Probability of Regular Sets of Trees.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014
On the Separation Question for Tree Languages.
Theory Comput. Syst., 2014

Measure Properties of Game Tree Languages.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

On the Decidability of MSO+U on Infinite Trees.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Deciding the Borel Complexity of Regular Tree Languages.
Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

2012
On Topological Completeness of Regular Tree Languages.
Proceedings of the Logic and Program Semantics, 2012

2009
On the Borel Inseparability of Game Tree Languages.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009


  Loading...