Laurent Bienvenu

Orcid: 0000-0002-9638-3362

According to our database1, Laurent Bienvenu authored at least 52 papers between 2006 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Relativized depth.
Theor. Comput. Sci., March, 2023

2022
Probabilistic vs Deterministic Gamblers.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

2021
Some Questions of Uniformity in Algorithmic Randomness.
J. Symb. Log., 2021

2020
On low for speed oracles.
J. Comput. Syst. Sci., 2020

2019
On the Interplay between Effective Notions of Randomness and Genericity.
J. Symb. Log., 2019

2018
Algorithmic identification of probabilities is hard.
J. Comput. Syst. Sci., 2018

2017
Randomness and Semimeasures.
Notre Dame J. Formal Log., 2017

Layerwise Computability and Image Randomness.
Theory Comput. Syst., 2017

Continuous higher randomness.
J. Math. Log., 2017

Diagonally non-computable functions and fireworks.
Inf. Comput., 2017

Parallel and Serial Jumps of Weak Weak König's Lemma.
Proceedings of the Computability and Complexity, 2017

2016
Generic algorithms for halting problem and optimal machines revisited.
Log. Methods Comput. Sci., 2016

Deep Pi<sub>1</sub><sup>0</sup> Classes.
Bull. Symb. Log., 2016

2015
Solovay functions and their applications in algorithmic randomness.
J. Comput. Syst. Sci., 2015

What Percentage of Programs Halt?
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.
Proceedings of the Fields of Logic and Computation II, 2015

2014
Characterizing Lowness for Demuth Randomness.
J. Symb. Log., 2014

Denjoy, Demuth and density.
J. Math. Log., 2014

On zeros of Martin-Löf random Brownian motion.
J. Log. Anal., 2014

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

Computing k-Trivial Sets by Incomplete Random Sets.
Bull. Symb. Log., 2014

The axiomatic power of Kolmogorov complexity.
Ann. Pure Appl. Log., 2014

Algorithmic Identification of Probabilities Is Hard.
Proceedings of the Algorithmic Learning Theory - 25th International Conference, 2014

2013
Joining non-low C.E. sets with diagonally non-computable functions.
J. Log. Comput., 2013

From bi-immunity to absolute undecidability.
J. Symb. Log., 2013

2012
Strong reductions in effective randomness.
Theor. Comput. Sci., 2012

How Powerful Are Integer-Valued Martingales?
Theory Comput. Syst., 2012

Separations of non-monotonic randomness notions.
J. Log. Comput., 2012

A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points.
Inf. Comput., 2012

Computability, Complexity and Randomness (Dagstuhl Seminar 12021).
Dagstuhl Reports, 2012

Limit complexities revisited [once more]
CoRR, 2012

Randomness and lowness notions via open covers.
Ann. Pure Appl. Log., 2012

The Denjoy alternative for computable functions.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Von Neumann's Biased Coin Revisited.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Random Semicomputable Reals Revisited.
Proceedings of the Computation, Physics and Beyond, 2012

2011
Algorithmic tests and randomness with respect to a class of measures
CoRR, 2011

Solovay functions and K-triviality.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

2010
Limit Complexities Revisited.
Theory Comput. Syst., 2010

Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity.
Theory Comput. Syst., 2010

Ergodic-Type Characterizations of Algorithmic Randomness.
Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2009
Constructive Dimension and Turing Degrees.
Theory Comput. Syst., 2009

Constructive equivalence relations on computable probability measures.
Ann. Pure Appl. Log., 2009

Kolmogorov Complexity and Solovay Functions.
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é).
PhD thesis, 2008

A Simple Proof of Miller-Yu Theorem.
Fundam. Informaticae, 2008

Limit complexities revisited.
Proceedings of the STACS 2008, 2008

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

2007
Reconciling Data Compression and Kolmogorov Complexity.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

The Dynamics of Cellular Automata in Shift-Invariant Topologies.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007

Constructive Dimension and Weak Truth-Table Degrees.
Proceedings of the Computation and Logic in the Real World, 2007

2006
Effective Randomness for Computable Probability Measures.
Proceedings of the Third International Conference on Computability and Complexity in Analysis, 2006

Constructive Equivalence Relations on Computable Probability Measures.
Proceedings of the Computer Science, 2006


  Loading...