Journal papers

L. Bienvenu, S. Figueira, B. Monin, A. Shen Algorithmic identifiation of probabilities is hard
Accepted to Journal of Computer and System Sciences (2018)
[PDF]

N. Greenberg, B. Monin Higher randomness and genericity
Accepted to Forum of mathematics, Sigma (2017)
[PDF]

L. Bienvenu, N. Greenberg, B. Monin Continuous Higher randomness
Accepted to Journal of Mathematical Logic (2017)
[PDF]

B. Monin Higher randomness and forcing with closed sets
Accepted to Theory of computing system (2016)
[PDF]

B. Monin, L. Patey Pi^0_1 encodability and omniscient reduction
Accepted to Notre Dame Journal of Formal Logic (2016)
[PDF]

N. Greenberg, J. Miller, B. Monin, D. Turetsky Two More characterizations of K-triviality
Accepted to Notre Dame Journal of Formal Logic (2015)
[PDF]

Conference papers

B. Monin An answer to the Gamma question
(formerly "Asymptotic density and error-correcting codes") Accepted to LICS 2018.
[PDF]

P.E. Angles d'Auriac, B. Monin Another characterization of the higher K-Trivials
Accepted to MFCS 2017.
[PDF]

B. Monin, A. Nies A unifying approach to the Gamma question
Accepted to LICS 2015.
[PDF]

L. Bienvenu, B. Monin, A. Shen Algorithmic identifiation of probabilities is hard
Accepted to ALT 2014.
[PDF]

B. Monin Higher randomness and forcing with closed sets
Accepted to STACS 2014.
[PDF]

L. Bienvenu, B. Monin von Neumann's biased coin revisited
Accepted to LICS 2012.
[PDF]

Submitted

P.E. Angles d'Auriac, B. Monin Genericity and randomness with ITTMs
[PDF]

B. Monin Higher randomness (Survey paper)
[PDF]

L. Liu, B. Monin, L. Patey A computable analysis of variable word theorems
[PDF]

In preparation

B. Monin, A. Nies Muchnik degrees and cardinal characteristics
[PDF]

B. Monin, L. Patey Pigeons do not jump high
[PDF]

Misc

PhD Report : Higher computability and randomness
[PDF]