Nombre de documents

25

CV de Laurent Bienvenu


Pré-publication, Document de travail6 documents

  • Laurent Bienvenu, Damien Desfontaines, Alexander Shen. Generic algorithms for halting problem and optimal machines revisited. 2015. <lirmm-01233778>
  • Laurent Bienvenu, Rupert Hölzl, Adam Day. From bi-immunity to absolute undecidability. 2012. <hal-00743008>
  • Laurent Bienvenu, Rupert Hölzl, Joseph Miller, André Nies. The Denjoy alternative for computable functions. Submitted to STACS 2012. 2011. <hal-00626275v3>
  • Laurent Bienvenu, Christopher Porter. Effective randomness, strong reductions and Demuth's theorem. Submitted to Theoretical Computer Science. 2011. <hal-00630308v2>
  • Bienvenu Laurent, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle. Separations of non-monotonic randomness notions. 21 pages. 2009. <hal-00403921>
  • Laurent Bienvenu, David Doty, Frank Stephan. Constructive dimension and weak truth-table degrees. submitted to Theory of Computing Systems. 2007. <hal-00191125>

Communication dans un congrès9 documents

  • Laurent Bienvenu, Damien Desfontaines, Alexander Shen. What Percentage of Programs Halt?. IICALP: nternational Colloquium on Automata, Languages, and Programming, Jul 2015, Kyoto, Japan. Springer, 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I, LNCS (9134), pp.219-230, 2015, Automata, Languages, and Programming. <http://link.springer.com/10.1007/978-3-662-47672-7>. <10.1007/978-3-662-47672-7>. <lirmm-01279151>
  • Laurent Bienvenu, Benoit Monin, Alexander Shen. Algorithmic Identification of Probabilities Is Hard. ALT: Algorithmic Learning Theory, Oct 2014, Bled, Slovenia. LNCS (8776), pp.85-95, 2014, Algorithmic Learning Theory. <10.1007/978-3-319-11662-4_7>. <hal-01397246>
  • Laurent Bienvenu, Alexander Shen. Random Semicomputable Reals Revisited. WTCS: Workshop on Theoretical Computer Science, Feb 2012, Auckland, New Zealand. LNCS, pp.031-045, 2012, Computation, Physics and Beyond. <http://www.cs.auckland.ac.nz/research/conferences/wtcs2012/>. <10.1007/978-3-642-27654-5>. <lirmm-00845796>
  • Laurent Bienvenu, Benoit Monin. von Neumann’s biased coin revisited. LICS 2012, Jun 2012, DUBROVNIK, Croatia. <hal-01397207>
  • Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller, André Nies. The Denjoy alternative for computable functions. Christoph Dürr, Thomas Wilke. STACS'12 (29th Symposium on Theoretical Aspects of Computer Science), Feb 2012, Paris, France. LIPIcs, 14, pp.543-554, 2012. <hal-00678180>
  • Laurent Bienvenu, Wolfgang Merkle, André Nies. Solovay functions and K-triviality. Symposium on Theoretical Aspects of Computer Science (STACS2011), Mar 2011, Dortmund, Germany. 9, pp.452-463, 0000. <hal-00573598>
  • Laurent Bienvenu, Rod Downey. Kolmogorov Complexity and Solovay Functions. Susanne Albers and Jean-Yves Marion. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. IBFI Schloss Dagstuhl, pp.147-158, 2009. <inria-00359056>
  • Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolay Vereshchagin. Limit complexities revisited. Susanne Albers, Pascal Weil. STACS 2008, Feb 2008, Bordeaux, France. IBFI Schloss Dagstuhl, pp.73-84, 2008. <hal-00218279>
  • Alexander Shen, Laurent Bienvenu, Andrei Romashchenko. Sparse sets. Bruno Durand. JAC 2008, Apr 2008, Uzès, France. Издательство МЦНМО, pp.18-28, 2008, Invited talk. <hal-00274010>

Article dans une revue5 documents

Autre publication1 document

  • Laurent Bienvenu, Mathieu Hoyrup, Alexander Shen. Layerwise computability and image randomness. submitted. 2016. <lirmm-01486486>

Chapitre d'ouvrage2 documents

  • Laurent Bienvenu, Rutger Kuyper. Parallel and Serial Jumps of Weak Weak König’s Lemma. Computability and Complexity, LNCS (10010), Springer, pp.201-2117, 2017, Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, 978-3-319-50061-4 (print) 978-3-319-50062-1 (online). <10.1007/978-3-319-50062-1_15>. <hal-01451088>
  • Laurent Bienvenu, Alexander Shen. K-trivial, K-low and MLR-low sequences: a tutorial. Fields of Logic and Computation II, LNCS (9300), Springer, pp.1-23, 2015, Essays Dedicated to Yuri Gurevich on the Occasion of His 75th Birthday, 978-3-319-23533-2. <10.1007/978-3-319-23534-9_1>. <lirmm-01233787>

Thèse1 document

  • Laurent Bienvenu. Game-theoretic approaches to randomness: unpredictability and stochasticity.. Other [cs.OH]. Université de Provence - Aix-Marseille I, 2008. English. <tel-00332425v2>

Rapport1 document

  • Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolay Vereshchagin. Limit complexities revisited [ once more ]. arxiv:1204-0201, 2012, pp.1-12. <lirmm-00786224>