Benoit Monin

According to our database1, Benoit Monin authored at least 14 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Partition Genericity and Pigeonhole Basis theorems.
J. Symb. Log., 2024

2021
Muchnik Degrees and cardinal characteristics.
J. Symb. Log., 2021

The weakness of the pigeonhole principle under hyperarithmetical reductions.
J. Math. Log., 2021

2019
Π<sub>1</sub>-Encodability and Omniscient Reductions.
Notre Dame J. Formal Log., 2019

2018
Two More Characterizations of <i>K</i>-Triviality.
Notre Dame J. Formal Log., 2018

Algorithmic identification of probabilities is hard.
J. Comput. Syst. Sci., 2018

An answer to the Gamma question.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017
Higher Randomness and Forcing with Closed Sets.
Theory Comput. Syst., 2017

Continuous higher randomness.
J. Math. Log., 2017

2015
A Unifying Approach to the Gamma Question.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014
Higher computability and Randomness. (Aléatoire et calculabilité d'ordre supérieur).
PhD thesis, 2014

Algorithmic Identification of Probabilities Is Hard.
Proceedings of the Algorithmic Learning Theory - 25th International Conference, 2014

2012
Von Neumann's Biased Coin Revisited.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

2009
Morality in tele-immersive environments.
Proceedings of the 2nd International ICST Conference on Immersive Telecommunications, 2009


  Loading...