Laurent Bienvenu

71 papers A* 2A 7B 1C 7Misc 1Journal 47Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Bridging computational notions of depth. Inf. Comput. Laurent Bienvenu, Christopher P. Porter
2025	J	`jnl`	A Markov-Chain Characterization of Finite-State Dimension and a Generalization of Agafonov's Theorem. CoRR Laurent Bienvenu, Hugo Gimbert, Subin Pulari
2025	—	`conf`	The Agafonov and Schnorr-Stimm Theorems for Probabilistic Automata. FSTTCS Laurent Bienvenu, Hugo Gimbert, Subin Pulari
2025	J	`jnl`	The Agafonov and Schnorr-Stimm theorems for probabilistic automata. CoRR Laurent Bienvenu, Hugo Gimbert, Subin Pulari
2024	J	`jnl`	Bridging Computational Notions of Depth. CoRR Laurent Bienvenu, Christopher P. Porter
2023	J	`jnl`	Relativized depth. Theor. Comput. Sci. Laurent Bienvenu, Valentino Delle Rose, Wolfgang Merkle
2022	A	`conf`	Probabilistic vs Deterministic Gamblers. STACS Laurent Bienvenu, Valentino Delle Rose, Tomasz Steifer
2021	J	`jnl`	Some Questions of Uniformity in Algorithmic Randomness. CoRR Laurent Bienvenu, Barbara F. Csima, Matthew Harrison-Trainor
2021	J	`jnl`	Some Questions of Uniformity in Algorithmic Randomness. J. Symb. Log. Laurent Bienvenu, Barbara F. Csima, Matthew Harrison-Trainor
2020	J	`jnl`	On low for speed oracles. J. Comput. Syst. Sci. Laurent Bienvenu, Rod Downey
2019	J	`jnl`	On the Interplay between Effective Notions of Randomness and Genericity. J. Symb. Log. Laurent Bienvenu, Christopher P. Porter
2018	J	`jnl`	Algorithmic identification of probabilities is hard. J. Comput. Syst. Sci. Laurent Bienvenu, Santiago Figueira, Benoit Monin, Alexander Shen
2018	A	`conf`	On Low for Speed Oracles. STACS Laurent Bienvenu, Rodney G. Downey
2017	J	`jnl`	Continuous higher randomness. J. Math. Log. Laurent Bienvenu, Noam Greenberg, Benoit Monin
2017	J	`jnl`	Diagonally non-computable functions and fireworks. Inf. Comput. Laurent Bienvenu, Ludovic Patey
2017	J	`jnl`	Layerwise Computability and Image Randomness. Theory Comput. Syst. Laurent Bienvenu, Mathieu Hoyrup, Alexander Shen
2017	J	`jnl`	On low for speed oracles. CoRR Laurent Bienvenu, Rod Downey
2017	—	`conf`	Parallel and Serial Jumps of Weak Weak König's Lemma. Computability and Complexity Laurent Bienvenu, Rutger Kuyper
2017	J	`jnl`	Randomness and Semimeasures. Notre Dame J. Formal Log. Laurent Bienvenu, Rupert Hölzl, Christopher P. Porter, Paul Shafer
2016	J	`jnl`	Deep Pi Bull. Symb. Log. Laurent Bienvenu, Christopher P. Porter
2016	J	`jnl`	Generic algorithms for halting problem and optimal machines revisited. Log. Methods Comput. Sci. Laurent Bienvenu, Damien Desfontaines, Alexander Shen
2016	J	`jnl`	Layerwise computability and image randomness. CoRR Laurent Bienvenu, Mathieu Hoyrup, Alexander Shen
2016	C	`ed.`	Pursuit of the Universal - 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016, Proceedings CiE Arnold Beckmann, Laurent Bienvenu, Natasa Jonoska
2015	J	`jnl`	Solovay functions and their applications in algorithmic randomness. J. Comput. Syst. Sci. Laurent Bienvenu, Rodney G. Downey, André Nies, Wolfgang Merkle
2015	—	`conf`	What Percentage of Programs Halt? ICALP (1) Laurent Bienvenu, Damien Desfontaines, Alexander Shen
2014	B	`conf`	Algorithmic Identification of Probabilities Is Hard. ALT Laurent Bienvenu, Benoit Monin, Alexander Shen
2014	J	`jnl`	Characterizing Lowness for Demuth Randomness. J. Symb. Log. Laurent Bienvenu, Rod Downey, Noam Greenberg, André Nies, Daniel Turetsky
2014	J	`jnl`	Computing k-Trivial Sets by Incomplete Random Sets. Bull. Symb. Log. Laurent Bienvenu, Adam R. Day, Noam Greenberg, Antonín Kucera, Joseph S. Miller, André Nies, Dan Turetsky
2014	J	`jnl`	Denjoy, Demuth and density. J. Math. Log. Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller, André Nies
2014	J	`jnl`	K-trivial, K-low and MLR-low sequences: a tutorial. CoRR Laurent Bienvenu, Alexander Shen
2014	J	`jnl`	On zeros of Martin-Löf random Brownian motion. J. Log. Anal. Laurent Bienvenu, Kelty Allen, Theodore A. Slaman
2014	J	`jnl`	The axiomatic power of Kolmogorov complexity. Ann. Pure Appl. Log. Laurent Bienvenu, Andrei Romashchenko, Alexander Shen, Antoine Taveneaux, Stijn Vermeeren
2013	J	`jnl`	From bi-immunity to absolute undecidability. J. Symb. Log. Laurent Bienvenu, Adam R. Day, Rupert Hölzl
2013	J	`jnl`	Joining non-low C.E. sets with diagonally non-computable functions. J. Log. Comput. Laurent Bienvenu, Noam Greenberg, Antonín Kucera, Joseph S. Miller, André Nies, Daniel Turetsky
2013	J	`jnl`	The axiomatic power of Kolmogorov complexity CoRR Laurent Bienvenu, Andrei Romashchenko, Alexander Shen, Antoine Taveneaux, Stijn Vermeeren
2012	J	`jnl`	A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points. Inf. Comput. Laurent Bienvenu, Adam R. Day, Mathieu Hoyrup, Ilya Mezhirov, Alexander Shen
2012	J	`jnl`	Computability, Complexity and Randomness (Dagstuhl Seminar 12021). Dagstuhl Reports Verónica Becher, Laurent Bienvenu, Rodney G. Downey, Elvira Mayordomo
2012	J	`jnl`	How Powerful Are Integer-Valued Martingales? Theory Comput. Syst. Laurent Bienvenu, Frank Stephan, Jason Teutsch
2012	J	`jnl`	Limit complexities revisited [once more] CoRR Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin
2012	—	`conf`	Random Semicomputable Reals Revisited. Computation, Physics and Beyond Laurent Bienvenu, Alexander Shen
2012	J	`jnl`	Randomness and lowness notions via open covers. Ann. Pure Appl. Log. Laurent Bienvenu, Joseph S. Miller
2012	J	`jnl`	Separations of non-monotonic randomness notions. J. Log. Comput. Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle
2012	J	`jnl`	Strong reductions in effective randomness. Theor. Comput. Sci. Laurent Bienvenu, Christopher P. Porter
2012	A	`conf`	The Denjoy alternative for computable functions. STACS Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller, André Nies
2012	A*	`conf`	Von Neumann's Biased Coin Revisited. LICS Laurent Bienvenu, Benoit Monin
2011	J	`jnl`	Algorithmic tests and randomness with respect to a class of measures CoRR Laurent Bienvenu, Péter Gács, Mathieu Hoyrup, Cristobal Rojas, Alexander Shen
2011	A	`conf`	Solovay functions and K-triviality. STACS Laurent Bienvenu, Wolfgang Merkle, André Nies
2010	J	`jnl`	A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points CoRR Laurent Bienvenu, Adam R. Day, Mathieu Hoyrup, Ilya Mezhirov, Alexander Shen
2010	C	`conf`	Ergodic-Type Characterizations of Algorithmic Randomness. CiE Laurent Bienvenu, Adam R. Day, Ilya Mezhirov, Alexander Shen
2010	C	`conf`	How Powerful Are Integer-Valued Martingales? CiE Laurent Bienvenu, Frank Stephan, Jason Teutsch
2010	J	`jnl`	How powerful are integer-valued martingales? CoRR Laurent Bienvenu, Frank Stephan, Jason Teutsch
2010	J	`jnl`	Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity. Theory Comput. Syst. Laurent Bienvenu
2010	J	`jnl`	Limit Complexities Revisited. Theory Comput. Syst. Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin
2009	J	`jnl`	Constructive Dimension and Turing Degrees. Theory Comput. Syst. Laurent Bienvenu, David Doty, Frank Stephan
2009	J	`jnl`	Constructive equivalence relations on computable probability measures. Ann. Pure Appl. Log. Laurent Bienvenu, Wolfgang Merkle
2009	J	`jnl`	Kolmogorov Complexity and Solovay Functions CoRR Laurent Bienvenu, Rod Downey
2009	A	`conf`	Kolmogorov Complexity and Solovay Functions. STACS Laurent Bienvenu, Rod Downey
2009	C	`conf`	Separations of Non-monotonic Randomness Notions. CCA Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle
2009	J	`jnl`	Separations of non-monotonic randomness notions CoRR Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle
2008	J	`jnl`	A Simple Proof of Miller-Yu Theorem. Fundam. Informaticae Laurent Bienvenu, Wolfgang Merkle, Alexander Shen
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	J	`jnl`	Limit complexities revisited CoRR Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin
2008	A	`conf`	Limit complexities revisited. STACS Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolay Veraschagin
2008	—	`conf`	Sparse sets. JAC Laurent Bienvenu, Andrei Romashchenko, Alexander Shen
2007	J	`jnl`	Constructive Dimension and Weak Truth-Table Degrees CoRR Laurent Bienvenu, David Doty, Frank Stephan
2007	C	`conf`	Constructive Dimension and Weak Truth-Table Degrees. CiE Laurent Bienvenu, David Doty, Frank Stephan
2007	A	`conf`	Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity. STACS Laurent Bienvenu
2007	A*	`conf`	Reconciling Data Compression and Kolmogorov Complexity. ICALP Laurent Bienvenu, Wolfgang Merkle
2007	C	`conf`	The Dynamics of Cellular Automata in Shift-Invariant Topologies. Developments in Language Theory Laurent Bienvenu, Mathieu Sablik
2006	Misc	`conf`	Constructive Equivalence Relations on Computable Probability Measures. CSR Laurent Bienvenu
2006	C	`conf`	Effective Randomness for Computable Probability Measures. CCA Laurent Bienvenu, Wolfgang Merkle