Laurent Bienvenu

According to our database, Laurent Bienvenu authored at least 53 papers between 2006 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Bridging Computational Notions of Depth.

Laurent Bienvenu, Christopher P. Porter

CoRR, 2024

2023

Relativized depth.

Laurent Bienvenu, Valentino Delle Rose, Wolfgang Merkle

Theor. Comput. Sci., March, 2023

2022

Probabilistic vs Deterministic Gamblers.

Laurent Bienvenu, Valentino Delle Rose, Tomasz Steifer

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

2021

Some Questions of Uniformity in Algorithmic Randomness.

Laurent Bienvenu, Barbara F. Csima, Matthew Harrison-Trainor

J. Symb. Log., 2021

2020

On low for speed oracles.

Laurent Bienvenu, Rod Downey

J. Comput. Syst. Sci., 2020

2019

On the Interplay between Effective Notions of Randomness and Genericity.

Laurent Bienvenu, Christopher P. Porter

J. Symb. Log., 2019

2018

Algorithmic identification of probabilities is hard.

Laurent Bienvenu, Santiago Figueira, Benoit Monin, Alexander Shen

J. Comput. Syst. Sci., 2018

2017

Randomness and Semimeasures.

Laurent Bienvenu, Rupert Hölzl, Christopher P. Porter, Paul Shafer

Notre Dame J. Formal Log., 2017

Layerwise Computability and Image Randomness.

Laurent Bienvenu, Mathieu Hoyrup, Alexander Shen

Theory Comput. Syst., 2017

Continuous higher randomness.

Laurent Bienvenu, Noam Greenberg, Benoit Monin

J. Math. Log., 2017

Diagonally non-computable functions and fireworks.

Laurent Bienvenu, Ludovic Patey

Inf. Comput., 2017

Parallel and Serial Jumps of Weak Weak König's Lemma.

Laurent Bienvenu, Rutger Kuyper

Proceedings of the Computability and Complexity, 2017

2016

Generic algorithms for halting problem and optimal machines revisited.

Laurent Bienvenu, Damien Desfontaines, Alexander Shen

Log. Methods Comput. Sci., 2016

Deep Pi₁⁰ Classes.

Laurent Bienvenu, Christopher P. Porter

Bull. Symb. Log., 2016

2015

Solovay functions and their applications in algorithmic randomness.

Laurent Bienvenu, Rodney G. Downey, André Nies, Wolfgang Merkle

J. Comput. Syst. Sci., 2015

What Percentage of Programs Halt?

Laurent Bienvenu, Damien Desfontaines, Alexander Shen

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

<i>K</i>-trivial, <i>K</i>-low and <i>MLR</i>-low Sequences: A Tutorial.

Laurent Bienvenu, Alexander Shen

Proceedings of the Fields of Logic and Computation II, 2015

2014

Characterizing Lowness for Demuth Randomness.

Laurent Bienvenu, Rod Downey, Noam Greenberg, André Nies, Daniel Turetsky

J. Symb. Log., 2014

Denjoy, Demuth and density.

Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller, André Nies

J. Math. Log., 2014

On zeros of Martin-Löf random Brownian motion.

Laurent Bienvenu, Kelty Allen, Theodore A. Slaman

J. Log. Anal., 2014

K-trivial, K-low and MLR-low sequences: a tutorial.

Laurent Bienvenu, Alexander Shen

CoRR, 2014

Computing k-Trivial Sets by Incomplete Random Sets.

Laurent Bienvenu, Adam R. Day, Noam Greenberg, Antonín Kucera, Joseph S. Miller, André Nies, Dan Turetsky

Bull. Symb. Log., 2014

The axiomatic power of Kolmogorov complexity.

Laurent Bienvenu, Andrei E. Romashchenko, Alexander Shen, Antoine Taveneaux, Stijn Vermeeren

Ann. Pure Appl. Log., 2014

Algorithmic Identification of Probabilities Is Hard.

Laurent Bienvenu, Benoit Monin, Alexander Shen

Proceedings of the Algorithmic Learning Theory - 25th International Conference, 2014

2013

Joining non-low C.E. sets with diagonally non-computable functions.

Laurent Bienvenu, Noam Greenberg, Antonín Kucera, Joseph S. Miller, André Nies, Daniel Turetsky

J. Log. Comput., 2013

From bi-immunity to absolute undecidability.

Laurent Bienvenu, Adam R. Day, Rupert Hölzl

J. Symb. Log., 2013

2012

Strong reductions in effective randomness.

Laurent Bienvenu, Christopher P. Porter

Theor. Comput. Sci., 2012

How Powerful Are Integer-Valued Martingales?

Laurent Bienvenu, Frank Stephan, Jason Teutsch

Theory Comput. Syst., 2012

Separations of non-monotonic randomness notions.

Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle

J. Log. Comput., 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

Inf. Comput., 2012

Computability, Complexity and Randomness (Dagstuhl Seminar 12021).

Verónica Becher, Laurent Bienvenu, Rodney G. Downey, Elvira Mayordomo

Dagstuhl Reports, 2012

Limit complexities revisited [once more]

Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin

CoRR, 2012

Randomness and lowness notions via open covers.

Laurent Bienvenu, Joseph S. Miller

Ann. Pure Appl. Log., 2012

The Denjoy alternative for computable functions.

Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller, André Nies

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Von Neumann's Biased Coin Revisited.

Laurent Bienvenu, Benoit Monin

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Random Semicomputable Reals Revisited.

Laurent Bienvenu, Alexander Shen

Proceedings of the Computation, Physics and Beyond, 2012

2011

Algorithmic tests and randomness with respect to a class of measures

Laurent Bienvenu, Péter Gács, Mathieu Hoyrup, Cristobal Rojas, Alexander Shen

CoRR, 2011

Solovay functions and K-triviality.

Laurent Bienvenu, Wolfgang Merkle, André Nies

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

2010

Limit Complexities Revisited.

Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin

Theory Comput. Syst., 2010

Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity.

Laurent Bienvenu

Theory Comput. Syst., 2010

Ergodic-Type Characterizations of Algorithmic Randomness.

Laurent Bienvenu, Adam R. Day, Ilya Mezhirov, Alexander Shen

Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2009

Constructive Dimension and Turing Degrees.

Laurent Bienvenu, David Doty, Frank Stephan

Theory Comput. Syst., 2009

Constructive equivalence relations on computable probability measures.

Laurent Bienvenu, Wolfgang Merkle

Ann. Pure Appl. Log., 2009

Kolmogorov Complexity and Solovay Functions.

Laurent Bienvenu, Rod Downey

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

2008

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

Laurent Bienvenu

PhD thesis, 2008

A Simple Proof of Miller-Yu Theorem.

Laurent Bienvenu, Wolfgang Merkle, Alexander Shen

Fundam. Informaticae, 2008

Limit complexities revisited.

Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolay Veraschagin

Proceedings of the STACS 2008, 2008

Sparse sets.

Laurent Bienvenu, Andrei E. Romashchenko, Alexander Shen

Proceedings of the First Symposium on Cellular Automata "Journées Automates Cellulaires" (JAC 2008), 2008

2007

Reconciling Data Compression and Kolmogorov Complexity.

Laurent Bienvenu, Wolfgang Merkle

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

The Dynamics of Cellular Automata in Shift-Invariant Topologies.

Laurent Bienvenu, Mathieu Sablik

Proceedings of the Developments in Language Theory, 11th International Conference, 2007

Constructive Dimension and Weak Truth-Table Degrees.

Laurent Bienvenu, David Doty, Frank Stephan

Proceedings of the Computation and Logic in the Real World, 2007

2006

Effective Randomness for Computable Probability Measures.

Laurent Bienvenu, Wolfgang Merkle

Proceedings of the Third International Conference on Computability and Complexity in Analysis, 2006

Constructive Equivalence Relations on Computable Probability Measures.

Laurent Bienvenu

Proceedings of the Computer Science, 2006