Morality in tele-immersive environments. - Kathryn Y. Segovia; Jeremy N. Bailenson; Benoit Monin (IMMERSCOM, 2009)

Von Neumann's Biased Coin Revisited. - Laurent Bienvenu; Benoit Monin (LICS, 2012)

Algorithmic Identification of Probabilities Is Hard. - Laurent Bienvenu; Benoit Monin; Alexander Shen 001 (ALT, 2014)

Higher computability and Randomness. (Aléatoire et calculabilité d'ordre supérieur). - Benoit Monin (2014)

A Unifying Approach to the Gamma Question. - Benoit Monin; André Nies (LICS, 2015)

Continuous higher randomness. - Laurent Bienvenu; Noam Greenberg; Benoit Monin (J. Math. Log., 2017)

Higher Randomness and Forcing with Closed Sets. - Benoit Monin (Theory Comput. Syst., 2017)

An answer to the Gamma question. - Benoit Monin (LICS, 2018)

Algorithmic identification of probabilities is hard. - Laurent Bienvenu; Santiago Figueira; Benoit Monin; Alexander Shen 001 (J. Comput. Syst. Sci., 2018)

Two More Characterizations of K-Triviality. - Noam Greenberg; Joseph S. Miller; Benoit Monin; Daniel Turetsky (Notre Dame J. Formal Log., 2018)

Π1-Encodability and Omniscient Reductions. - Benoit Monin; Ludovic Patey (Notre Dame J. Formal Log., 2019)

The weakness of the pigeonhole principle under hyperarithmetical reductions. - Benoit Monin; Ludovic Patey (J. Math. Log., 2021)

Muchnik Degrees and cardinal characteristics. - Benoit Monin; André Nies (J. Symb. Log., 2021)

Partition Genericity and Pigeonhole Basis theorems. - Benoit Monin; Ludovic Patey (J. Symb. Log., 2024)