Constructive Equivalence Relations on Computable Probability Measures. - Laurent Bienvenu (CSR, 2006)

Effective Randomness for Computable Probability Measures. - Laurent Bienvenu; Wolfgang Merkle (CCA, 2006)

Constructive Dimension and Weak Truth-Table Degrees. - Laurent Bienvenu; David Doty; Frank Stephan 001 (CiE, 2007)

The Dynamics of Cellular Automata in Shift-Invariant Topologies. - Laurent Bienvenu; Mathieu Sablik (Developments in Language Theory, 2007)

Reconciling Data Compression and Kolmogorov Complexity. - Laurent Bienvenu; Wolfgang Merkle (ICALP, 2007)

Sparse sets. - Laurent Bienvenu; Andrei E. Romashchenko; Alexander Shen 001 (JAC, 2008)

Limit complexities revisited. - Laurent Bienvenu; Andrej Muchnik; Alexander Shen 001; Nikolay Veraschagin (STACS, 2008)

A Simple Proof of Miller-Yu Theorem. - Laurent Bienvenu; Wolfgang Merkle; Alexander Shen 001 (Fundam. Informaticae, 2008)

Game-theoretic approaches to randomness: unpredictability and stochasticity. (Caractérisations de l'aléatoire par les jeux: imprédictibilité et stochasticité). - Laurent Bienvenu (2008)

Kolmogorov Complexity and Solovay Functions. - Laurent Bienvenu; Rod Downey (STACS, 2009)

Constructive equivalence relations on computable probability measures. - Laurent Bienvenu; Wolfgang Merkle (Ann. Pure Appl. Log., 2009)

Constructive Dimension and Turing Degrees. - Laurent Bienvenu; David Doty; Frank Stephan 001 (Theory Comput. Syst., 2009)

Ergodic-Type Characterizations of Algorithmic Randomness. - Laurent Bienvenu; Adam R. Day; Ilya Mezhirov; Alexander Shen 001 (CiE, 2010)

Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity. - Laurent Bienvenu (Theory Comput. Syst., 2010)

Limit Complexities Revisited. - Laurent Bienvenu; Andrej Muchnik; Alexander Shen 001; Nikolai K. Vereshchagin (Theory Comput. Syst., 2010)

Solovay functions and K-triviality. - Laurent Bienvenu; Wolfgang Merkle; André Nies (STACS, 2011)

Algorithmic tests and randomness with respect to a class of measures - Laurent Bienvenu; Péter Gács; Mathieu Hoyrup; Cristobal Rojas; Alexander Shen 001 (CoRR, 2011)

Random Semicomputable Reals Revisited. - Laurent Bienvenu; Alexander Shen 001 (Computation, Physics and Beyond, 2012)

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

The Denjoy alternative for computable functions. - Laurent Bienvenu; Rupert Hölzl 001; Joseph S. Miller; André Nies (STACS, 2012)

Randomness and lowness notions via open covers. - Laurent Bienvenu; Joseph S. Miller (Ann. Pure Appl. Log., 2012)

Limit complexities revisited [once more] - Laurent Bienvenu; Andrej Muchnik; Alexander Shen 001; Nikolai K. Vereshchagin (CoRR, 2012)

Computability, Complexity and Randomness (Dagstuhl Seminar 12021). - Verónica Becher; Laurent Bienvenu; Rodney G. Downey; Elvira Mayordomo (Dagstuhl Reports, 2012)

A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points. - Laurent Bienvenu; Adam R. Day; Mathieu Hoyrup; Ilya Mezhirov; Alexander Shen 001 (Inf. Comput., 2012)

Separations of non-monotonic randomness notions. - Laurent Bienvenu; Rupert Hölzl 001; Thorsten Kräling; Wolfgang Merkle (J. Log. Comput., 2012)

How Powerful Are Integer-Valued Martingales? - Laurent Bienvenu; Frank Stephan 001; Jason Teutsch (Theory Comput. Syst., 2012)

Strong reductions in effective randomness. - Laurent Bienvenu; Christopher P. Porter (Theor. Comput. Sci., 2012)

From bi-immunity to absolute undecidability. - Laurent Bienvenu; Adam R. Day; Rupert Hölzl 001 (J. Symb. Log., 2013)

Joining non-low C.E. sets with diagonally non-computable functions. - Laurent Bienvenu; Noam Greenberg; Antonín Kucera 002; Joseph S. Miller; André Nies; Daniel Turetsky (J. Log. Comput., 2013)

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

The axiomatic power of Kolmogorov complexity. - Laurent Bienvenu; Andrei E. Romashchenko; Alexander Shen 001; Antoine Taveneaux; Stijn Vermeeren (Ann. Pure Appl. Log., 2014)

Computing k-Trivial Sets by Incomplete Random Sets. - Laurent Bienvenu; Adam R. Day; Noam Greenberg; Antonín Kucera 002; Joseph S. Miller; André Nies; Dan Turetsky (Bull. Symb. Log., 2014)

K-trivial, K-low and MLR-low sequences: a tutorial. - Laurent Bienvenu; Alexander Shen 001 (CoRR, 2014)

On zeros of Martin-Löf random Brownian motion. - Laurent Bienvenu; Kelty Allen; Theodore A. Slaman (J. Log. Anal., 2014)

Denjoy, Demuth and density. - Laurent Bienvenu; Rupert Hölzl 001; Joseph S. Miller; André Nies (J. Math. Log., 2014)

Characterizing Lowness for Demuth Randomness. - Laurent Bienvenu; Rod Downey; Noam Greenberg; André Nies; Daniel Turetsky (J. Symb. Log., 2014)

K-trivial, K-low and MLR-low Sequences: A Tutorial. - Laurent Bienvenu; Alexander Shen 001 (Fields of Logic and Computation II, 2015)

What Percentage of Programs Halt? - Laurent Bienvenu; Damien Desfontaines; Alexander Shen 001 (ICALP (1), 2015)

Solovay functions and their applications in algorithmic randomness. - Laurent Bienvenu; Rodney G. Downey; André Nies; Wolfgang Merkle (J. Comput. Syst. Sci., 2015)

Deep Pi10 Classes. - Laurent Bienvenu; Christopher P. Porter (Bull. Symb. Log., 2016)

Generic algorithms for halting problem and optimal machines revisited. - Laurent Bienvenu; Damien Desfontaines; Alexander Shen 001 (Log. Methods Comput. Sci., 2016)

Parallel and Serial Jumps of Weak Weak König's Lemma. - Laurent Bienvenu; Rutger Kuyper (Computability and Complexity, 2017)

Diagonally non-computable functions and fireworks. - Laurent Bienvenu; Ludovic Patey (Inf. Comput., 2017)

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

Layerwise Computability and Image Randomness. - Laurent Bienvenu; Mathieu Hoyrup; Alexander Shen 001 (Theory Comput. Syst., 2017)

Randomness and Semimeasures. - Laurent Bienvenu; Rupert Hölzl 001; Christopher P. Porter; Paul Shafer (Notre Dame J. Formal Log., 2017)

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

On the Interplay between Effective Notions of Randomness and Genericity. - Laurent Bienvenu; Christopher P. Porter (J. Symb. Log., 2019)

On low for speed oracles. - Laurent Bienvenu; Rod Downey (J. Comput. Syst. Sci., 2020)

Some Questions of Uniformity in Algorithmic Randomness. - Laurent Bienvenu; Barbara F. Csima; Matthew Harrison-Trainor (J. Symb. Log., 2021)

Probabilistic vs Deterministic Gamblers. - Laurent Bienvenu; Valentino Delle Rose; Tomasz Steifer (STACS, 2022)

Relativized depth. - Laurent Bienvenu; Valentino Delle Rose; Wolfgang Merkle (Theor. Comput. Sci., 2023)

Bridging Computational Notions of Depth. - Laurent Bienvenu; Christopher P. Porter (CoRR, 2024)

The Agafonov and Schnorr-Stimm theorems for probabilistic automata. - Laurent Bienvenu; Hugo Gimbert; Subin Pulari (CoRR, 2025)