default search action
Laurent Bienvenu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i15]Laurent Bienvenu, Christopher P. Porter:
Bridging Computational Notions of Depth. CoRR abs/2403.04045 (2024) - 2023
- [j29]Laurent Bienvenu
, Valentino Delle Rose
Relativized depth. Theor. Comput. Sci. 949: 113694 (2023) - 2022
- [c22]Laurent Bienvenu, Valentino Delle Rose
Probabilistic vs Deterministic Gamblers. STACS 2022: 11:1-11:13 - 2021
- [j28]Laurent Bienvenu, Barbara F. Csima, Matthew Harrison-Trainor:
Some Questions of Uniformity in Algorithmic Randomness. J. Symb. Log. 86(4): 1612-1631 (2021) - [i14]Laurent Bienvenu, Barbara F. Csima, Matthew Harrison-Trainor:
Some Questions of Uniformity in Algorithmic Randomness. CoRR abs/2111.01472 (2021) - 2020
- [j27]Laurent Bienvenu, Rod Downey:
On low for speed oracles. J. Comput. Syst. Sci. 108: 49-63 (2020)
2010 – 2019
- 2019
- [j26]Laurent Bienvenu, Christopher P. Porter:
On the Interplay between Effective Notions of Randomness and Genericity. J. Symb. Log. 84(1): 393-407 (2019) - 2018
- [j25]Laurent Bienvenu, Santiago Figueira, Benoit Monin, Alexander Shen:
Algorithmic identification of probabilities is hard. J. Comput. Syst. Sci. 95: 98-108 (2018) - [c21]Laurent Bienvenu, Rodney G. Downey:
On Low for Speed Oracles. STACS 2018: 15:1-15:13 - 2017
- [j24]Laurent Bienvenu, Ludovic Patey
Diagonally non-computable functions and fireworks. Inf. Comput. 253: 64-77 (2017) - [j23]Laurent Bienvenu, Noam Greenberg, Benoit Monin:
Continuous higher randomness. J. Math. Log. 17(1): 1750004:1-1750004:53 (2017) - [j22]Laurent Bienvenu, Mathieu Hoyrup, Alexander Shen
Layerwise Computability and Image Randomness. Theory Comput. Syst. 61(4): 1353-1375 (2017) - [j21]Laurent Bienvenu, Rupert Hölzl, Christopher P. Porter, Paul Shafer:
Randomness and Semimeasures. Notre Dame J. Formal Log. 58(3): 301-328 (2017) - [c20]Laurent Bienvenu, Rutger Kuyper:
Parallel and Serial Jumps of Weak Weak König's Lemma. Computability and Complexity 2017: 201-217 - [i13]Laurent Bienvenu, Rod Downey:
On low for speed oracles. CoRR abs/1712.09710 (2017) - 2016
- [j20]Laurent Bienvenu, Christopher P. Porter:
Deep Pi10 Classes. Bull. Symb. Log. 22(2): 249-286 (2016) - [j19]Laurent Bienvenu, Damien Desfontaines, Alexander Shen
Generic algorithms for halting problem and optimal machines revisited. Log. Methods Comput. Sci. 12(2) (2016) - [e1]Arnold Beckmann, Laurent Bienvenu, Natasa Jonoska:
Pursuit of the Universal - 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016, Proceedings. Lecture Notes in Computer Science 9709, Springer 2016, ISBN 978-3-319-40188-1 [contents] - [i12]Laurent Bienvenu, Mathieu Hoyrup, Alexander Shen:
Layerwise computability and image randomness. CoRR abs/1607.04232 (2016) - 2015
- [j18]Laurent Bienvenu, Rodney G. Downey, André Nies
Solovay functions and their applications in algorithmic randomness. J. Comput. Syst. Sci. 81(8): 1575-1591 (2015) - [c19]Laurent Bienvenu, Alexander Shen
K-trivial, K-low and MLR-low Sequences: A Tutorial. Fields of Logic and Computation II 2015: 1-23 - [c18]Laurent Bienvenu, Damien Desfontaines, Alexander Shen
What Percentage of Programs Halt? ICALP (1) 2015: 219-230 - 2014
- [j17]Laurent Bienvenu, Andrei E. Romashchenko
The axiomatic power of Kolmogorov complexity. Ann. Pure Appl. Log. 165(9): 1380-1402 (2014) - [j16]Laurent Bienvenu, Adam R. Day
Computing k-Trivial Sets by Incomplete Random Sets. Bull. Symb. Log. 20(1): 80-90 (2014) - [j15]Laurent Bienvenu, Kelty Allen, Theodore A. Slaman:
On zeros of Martin-Löf random Brownian motion. J. Log. Anal. 6 (2014) - [j14]Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller
Denjoy, Demuth and density. J. Math. Log. 14(1): 1450004 (2014) - [j13]Laurent Bienvenu, Rod Downey, Noam Greenberg, André Nies
Characterizing Lowness for Demuth Randomness. J. Symb. Log. 79(2): 526-560 (2014) - [c17]Laurent Bienvenu, Benoit Monin, Alexander Shen:
Algorithmic Identification of Probabilities Is Hard. ALT 2014: 85-95 - [i11]Laurent Bienvenu, Alexander Shen:
K-trivial, K-low and MLR-low sequences: a tutorial. CoRR abs/1407.4259 (2014) - 2013
- [j12]Laurent Bienvenu, Adam R. Day, Rupert Hölzl:
From bi-immunity to absolute undecidability. J. Symb. Log. 78(4): 1218-1228 (2013) - [j11]Laurent Bienvenu, Noam Greenberg, Antonín Kucera
Joining non-low C.E. sets with diagonally non-computable functions. J. Log. Comput. 23(6): 1183-1194 (2013) - [i10]Laurent Bienvenu, Andrei E. Romashchenko, Alexander Shen, Antoine Taveneaux, Stijn Vermeeren:
The axiomatic power of Kolmogorov complexity. CoRR abs/1301.3392 (2013) - 2012
- [j10]Laurent Bienvenu, Joseph S. Miller
Randomness and lowness notions via open covers. Ann. Pure Appl. Log. 163(5): 506-518 (2012) - [j9]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: 21-30 (2012) - [j8]Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle:
Separations of non-monotonic randomness notions. J. Log. Comput. 22(4): 701-715 (2012) - [j7]Laurent Bienvenu, Frank Stephan
How Powerful Are Integer-Valued Martingales? Theory Comput. Syst. 51(3): 330-351 (2012) - [j6]Laurent Bienvenu, Christopher P. Porter:
Strong reductions in effective randomness. Theor. Comput. Sci. 459: 55-68 (2012) - [c16]Laurent Bienvenu, Alexander Shen
Random Semicomputable Reals Revisited. Computation, Physics and Beyond 2012: 31-45 - [c15]Laurent Bienvenu, Benoit Monin:
Von Neumann's Biased Coin Revisited. LICS 2012: 145-154 - [c14]Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller
The Denjoy alternative for computable functions. STACS 2012: 543-554 - [i9]Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin:
Limit complexities revisited [once more]. CoRR abs/1204.0201 (2012) - [i8]Verónica Becher
Computability, Complexity and Randomness (Dagstuhl Seminar 12021). Dagstuhl Reports 2(1): 19-38 (2012) - 2011
- [c13]Laurent Bienvenu, Wolfgang Merkle, André Nies
Solovay functions and K-triviality. STACS 2011: 452-463 - [i7]Laurent Bienvenu, Péter Gács, Mathieu Hoyrup, Cristobal Rojas, Alexander Shen:
Algorithmic tests and randomness with respect to a class of measures. CoRR abs/1103.1529 (2011) - 2010
- [j5]Laurent Bienvenu:
Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity. Theory Comput. Syst. 46(3): 598-617 (2010) - [j4]Laurent Bienvenu, Andrej Muchnik, Alexander Shen
Limit Complexities Revisited. Theory Comput. Syst. 47(3): 720-736 (2010) - [c12]Laurent Bienvenu, Adam R. Day, Ilya Mezhirov, Alexander Shen
Ergodic-Type Characterizations of Algorithmic Randomness. CiE 2010: 49-58 - [c11]Laurent Bienvenu, Frank Stephan
How Powerful Are Integer-Valued Martingales? CiE 2010: 59-68 - [i6]Laurent Bienvenu, Frank Stephan, Jason Teutsch:
How powerful are integer-valued martingales? CoRR abs/1004.0838 (2010) - [i5]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 abs/1007.5249 (2010)
2000 – 2009
- 2009
- [j3]Laurent Bienvenu, Wolfgang Merkle:
Constructive equivalence relations on computable probability measures. Ann. Pure Appl. Log. 160(3): 238-254 (2009) - [j2]Laurent Bienvenu, David Doty
Constructive Dimension and Turing Degrees. Theory Comput. Syst. 45(4): 740-755 (2009) - [c10]Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle:
Separations of Non-monotonic Randomness Notions. CCA 2009 - [c9]Laurent Bienvenu, Rod Downey:
Kolmogorov Complexity and Solovay Functions. STACS 2009: 147-158 - [i4]Laurent Bienvenu, Rod Downey:
Kolmogorov Complexity and Solovay Functions. CoRR abs/0902.1041 (2009) - [i3]Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle:
Separations of non-monotonic randomness notions. CoRR abs/0907.2324 (2009) - 2008
- [b1]Laurent Bienvenu:
Game-theoretic approaches to randomness: unpredictability and stochasticity. (Caractérisations de l'aléatoire par les jeux: imprédictibilité et stochasticité). University of Provence, France, 2008 - [j1]Laurent Bienvenu, Wolfgang Merkle, Alexander Shen:
A Simple Proof of Miller-Yu Theorem. Fundam. Informaticae 83(1-2): 21-24 (2008) - [c8]Laurent Bienvenu, Andrei E. Romashchenko, Alexander Shen:
Sparse sets. JAC 2008: 18-28 - [c7]Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolay Veraschagin:
Limit complexities revisited. STACS 2008: 73-84 - [i2]Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin:
Limit complexities revisited. CoRR abs/0802.2833 (2008) - 2007
- [c6]Laurent Bienvenu, David Doty
Constructive Dimension and Weak Truth-Table Degrees. CiE 2007: 63-72 - [c5]Laurent Bienvenu, Mathieu Sablik:
The Dynamics of Cellular Automata in Shift-Invariant Topologies. Developments in Language Theory 2007: 84-95 - [c4]Laurent Bienvenu, Wolfgang Merkle:
Reconciling Data Compression and Kolmogorov Complexity. ICALP 2007: 643-654 - [c3]Laurent Bienvenu:
Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity. STACS 2007: 260-271 - [i1]Laurent Bienvenu, David Doty, Frank Stephan:
Constructive Dimension and Weak Truth-Table Degrees. CoRR abs/cs/0701089 (2007) - 2006
- [c2]Laurent Bienvenu:
Constructive Equivalence Relations on Computable Probability Measures. CSR 2006: 92-103 - [c1]Laurent Bienvenu, Wolfgang Merkle:
Effective Randomness for Computable Probability Measures. CCA 2006: 117-130
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-26 00:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: