Laurent Bienvenu

ORCID

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 18

Top Venues

CoRR

J. Comput. Syst. Sci.

J. Symb. Log.

Bull. Symb. Log.

University of Provence, France (PHD)

Education History

University of Provence, France

PHD

Publications

Laurent Bienvenu, Christopher P. Porter
Bridging Computational Notions of Depth. CoRR (2024)
Laurent Bienvenu, Valentino Delle Rose, Wolfgang Merkle
Relativized depth. Theor. Comput. Sci. 949 (2023)
Laurent Bienvenu, Valentino Delle Rose, Tomasz Steifer
Probabilistic vs Deterministic Gamblers. STACS (2022)
Laurent Bienvenu, Barbara F. Csima, Matthew Harrison-Trainor
Some Questions of Uniformity in Algorithmic Randomness. J. Symb. Log. 86 (4) (2021)
Laurent Bienvenu, Barbara F. Csima, Matthew Harrison-Trainor
Some Questions of Uniformity in Algorithmic Randomness. CoRR (2021)
Laurent Bienvenu, Rod Downey
On low for speed oracles. J. Comput. Syst. Sci. 108 (2020)
Laurent Bienvenu, Christopher P. Porter
On the Interplay between Effective Notions of Randomness and Genericity. J. Symb. Log. 84 (1) (2019)
Laurent Bienvenu, Rodney G. Downey
On Low for Speed Oracles. STACS (2018)
Laurent Bienvenu, Santiago Figueira, Benoit Monin, Alexander Shen
Algorithmic identification of probabilities is hard. J. Comput. Syst. Sci. 95 (2018)
Laurent Bienvenu, Ludovic Patey
Diagonally non-computable functions and fireworks. Inf. Comput. 253 (2017)
Laurent Bienvenu, Noam Greenberg, Benoit Monin
Continuous higher randomness. J. Math. Log. 17 (1) (2017)
Laurent Bienvenu, Rupert Hölzl, Christopher P. Porter, Paul Shafer
Randomness and Semimeasures. Notre Dame J. Formal Log. 58 (3) (2017)
Laurent Bienvenu, Mathieu Hoyrup, Alexander Shen
Layerwise Computability and Image Randomness. Theory Comput. Syst. 61 (4) (2017)
Laurent Bienvenu, Rutger Kuyper
Parallel and Serial Jumps of Weak Weak König's Lemma. Computability and Complexity (2017)
Laurent Bienvenu, Rod Downey
On low for speed oracles. CoRR (2017)
Laurent Bienvenu, Christopher P. Porter
Classes. Bull. Symb. Log. 22 (2) (2016)
Laurent Bienvenu, Damien Desfontaines, Alexander Shen
Generic algorithms for halting problem and optimal machines revisited. Log. Methods Comput. Sci. 12 (2) (2016)
Laurent Bienvenu, Mathieu Hoyrup, Alexander Shen
Layerwise computability and image randomness. CoRR (2016)
Laurent Bienvenu, Alexander Shen
-low Sequences: A Tutorial. Fields of Logic and Computation II (2015)
Laurent Bienvenu, Rodney G. Downey, André Nies, Wolfgang Merkle
Solovay functions and their applications in algorithmic randomness. J. Comput. Syst. Sci. 81 (8) (2015)
Laurent Bienvenu, Damien Desfontaines, Alexander Shen
What Percentage of Programs Halt? ICALP (1) (2015)
Laurent Bienvenu, Benoit Monin, Alexander Shen
Algorithmic Identification of Probabilities Is Hard. ALT (2014)
Laurent Bienvenu, Kelty Allen, Theodore A. Slaman
On zeros of Martin-Löf random Brownian motion. J. Log. Anal. 6 (2014)
Laurent Bienvenu, Rod Downey, Noam Greenberg, André Nies, Daniel Turetsky
Characterizing Lowness for Demuth Randomness. J. Symb. Log. 79 (2) (2014)
Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller, André Nies
Denjoy, Demuth and density. J. Math. Log. 14 (1) (2014)
Laurent Bienvenu, Alexander Shen
K-trivial, K-low and MLR-low sequences: a tutorial. CoRR (2014)
Laurent Bienvenu, Adam R. Day, Noam Greenberg, Antonín Kucera, Joseph S. Miller, André Nies, Dan Turetsky
Computing k-Trivial Sets by Incomplete Random Sets. Bull. Symb. Log. 20 (1) (2014)
Laurent Bienvenu, Andrei E. Romashchenko, Alexander Shen, Antoine Taveneaux, Stijn Vermeeren
The axiomatic power of Kolmogorov complexity. Ann. Pure Appl. Log. 165 (9) (2014)
Laurent Bienvenu, Andrei E. Romashchenko, Alexander Shen, Antoine Taveneaux, Stijn Vermeeren
The axiomatic power of Kolmogorov complexity CoRR (2013)
Laurent Bienvenu, Noam Greenberg, Antonín Kucera, Joseph S. Miller, André Nies, Daniel Turetsky
Joining non-low C.E. sets with diagonally non-computable functions. J. Log. Comput. 23 (6) (2013)
Laurent Bienvenu, Adam R. Day, Rupert Hölzl
From bi-immunity to absolute undecidability. J. Symb. Log. 78 (4) (2013)
Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle
Separations of non-monotonic randomness notions. J. Log. Comput. 22 (4) (2012)
Laurent Bienvenu, Benoit Monin
Von Neumann's Biased Coin Revisited. LICS (2012)
Verónica Becher, Laurent Bienvenu, Rodney G. Downey, Elvira Mayordomo
Computability, Complexity and Randomness (Dagstuhl Seminar 12021). Dagstuhl Reports 2 (1) (2012)
Laurent Bienvenu, Alexander Shen
Random Semicomputable Reals Revisited. Computation, Physics and Beyond (2012)
Laurent Bienvenu, Christopher P. Porter
Strong reductions in effective randomness. Theor. Comput. Sci. 459 (2012)
Laurent Bienvenu, Frank Stephan, Jason Teutsch
How Powerful Are Integer-Valued Martingales? Theory Comput. Syst. 51 (3) (2012)
Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller, André Nies
The Denjoy alternative for computable functions. STACS (2012)
Laurent Bienvenu, Joseph S. Miller
Randomness and lowness notions via open covers. Ann. Pure Appl. Log. 163 (5) (2012)
Laurent Bienvenu, Adam R. Day, Mathieu Hoyrup, Ilya Mezhirov, Alexander Shen
A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points. Inf. Comput. 210 (2012)
Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin
Limit complexities revisited [once more] CoRR (2012)
Laurent Bienvenu, Péter Gács, Mathieu Hoyrup, Cristobal Rojas, Alexander Shen
Algorithmic tests and randomness with respect to a class of measures CoRR (2011)
Laurent Bienvenu, Wolfgang Merkle, André Nies
Solovay functions and K-triviality. STACS (2011)
Laurent Bienvenu, Frank Stephan, Jason Teutsch
How powerful are integer-valued martingales? CoRR (2010)
Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin
Limit Complexities Revisited. Theory Comput. Syst. 47 (3) (2010)
Laurent Bienvenu, Adam R. Day, Mathieu Hoyrup, Ilya Mezhirov, Alexander Shen
A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points CoRR (2010)
Laurent Bienvenu
Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity. Theory Comput. Syst. 46 (3) (2010)
Laurent Bienvenu, Frank Stephan, Jason Teutsch
How Powerful Are Integer-Valued Martingales? CiE (2010)
Laurent Bienvenu, Adam R. Day, Ilya Mezhirov, Alexander Shen
Ergodic-Type Characterizations of Algorithmic Randomness. CiE (2010)
Laurent Bienvenu, David Doty, Frank Stephan
Constructive Dimension and Turing Degrees. Theory Comput. Syst. 45 (4) (2009)
Laurent Bienvenu, Wolfgang Merkle
Constructive equivalence relations on computable probability measures. Ann. Pure Appl. Log. 160 (3) (2009)
Laurent Bienvenu, Rod Downey
Kolmogorov Complexity and Solovay Functions. STACS (2009)
Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle
Separations of Non-monotonic Randomness Notions. CCA (2009)
Laurent Bienvenu, Rod Downey
Kolmogorov Complexity and Solovay Functions CoRR (2009)
Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle
Separations of non-monotonic randomness notions CoRR (2009)
Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin
Limit complexities revisited CoRR (2008)
Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolay Veraschagin
Limit complexities revisited. STACS (2008)
Laurent Bienvenu, Wolfgang Merkle, Alexander Shen
A Simple Proof of Miller-Yu Theorem. Fundam. Informaticae 83 (1-2) (2008)
Laurent Bienvenu, Andrei E. Romashchenko, Alexander Shen
Sparse sets. JAC (2008)
Laurent Bienvenu
Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity. STACS (2007)
Laurent Bienvenu, David Doty, Frank Stephan
Constructive Dimension and Weak Truth-Table Degrees CoRR (2007)
Laurent Bienvenu, David Doty, Frank Stephan
Constructive Dimension and Weak Truth-Table Degrees. CiE (2007)
Laurent Bienvenu, Wolfgang Merkle
Effective Randomness for Computable Probability Measures. Electron. Notes Theor. Comput. Sci. 167 (2007)
Laurent Bienvenu, Mathieu Sablik
The Dynamics of Cellular Automata in Shift-Invariant Topologies. Developments in Language Theory (2007)
Laurent Bienvenu, Wolfgang Merkle
Reconciling Data Compression and Kolmogorov Complexity. ICALP (2007)
Laurent Bienvenu
Constructive Equivalence Relations on Computable Probability Measures. CSR (2006)

Laurent Bienvenu.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Laurent Bienvenu