Journal papers
[J29]
Optimal bounds for single-source Kolmogorov extractors.
Transactions of
the American Mathematical Society 373,
pp. 1983-2006, 2020 .
[arXiv]
[J28]
On low for speed oracles.
Journal of
Computer and System Sciences 108, pp.49-63,
2020 .
[arXiv]
[J27]
On the Interplay between Effective Notions of Randomness and Genericity.
Journal of Symbolic Logic 84(1), pp. 393-407, 2019.
[arXiv]
[J26]
Algorithmic identification of probabilities is hard.
Journal of Computer and System Sciences 95, pp. 98-108, 2018.
[arXiv]
Journal of Mathematical Logic 17(1), 1750004, 2017.
[arXiv]
[J24]
On the logical strengths of partial solutions to mathematical problems.
Transactions of the London Mathematical Society 4(1), pp. 30-71, 2017.
[arXiv]
[J23]
Diagonally non-computable functions and fireworks.
Information and computation 253, pp. 64-77, 2017.
[arXiv]
[J22]
Randomness and semimeasures.
Notre Dame Journal of Formal Logic 58(3), pp. 301-328, 2017.
[arXiv]
[J21]
Generic algorithms for halting problem and optimal machines revisited.
Logical Methods in Computer Science 12(2), 2016.
[arXiv]
[J20]
Deep \Pi^0_1 classes.
Bulletin of Symbolic Logic 22(2), pp. 249-286, 2016.
[arXiv]
[J19]
Coherent randomness tests and computing the K-trivial sets.
Journal of the European Mathematical Society 18(4), pp 773-812, 2016.
[pdf]
[J18]
Solovay functions and their applications in algorithmic randomness.
Journal of Computer and System Sciences 81(8), pp 1575–1591, 2015.
[arXiv]
Note: the arXiv version corrects an error in item (ii) of the abstract of the journal version.
[J17]
On zeros of Martin-Löf random Brownian motion.
Journal of Logic and Analysis 6(9), pp 1-34, 2014.
[journal]
[J16]
Denjoy, Demuth and density.
Journal of Mathematical Logic. 14, 2014.
[arXiv]
[J15]
The axiomatic power of Kolmogorov complexity.
Annals of Pure and Applied Logic 165(9), pp 1380-1402, 2014.
[arXiv]
[J14]
Characterizing lowness for Demuth randomness.
Journal of Symbolic Logic 79, pp 526-560, 2014.
[pdf]
[J13]
Joining non-low c.e. sets with diagonally non-computable functions.
Journal Logic and Computation 23(6), pp 1183-1194, 2013.
[pdf]
[J12]
From bi-immunity to absolute undecidability.
Journal of Symbolic Logic 78(4), pp 1218-1228, 2013.
[pdf]
[J11]
Strong reductions in effective randomness.
Theoretical Computer Science 459, pp 55-68, 2012.
[pdf]
[J10]
A constructive version of
Birkhoff’s ergodic theorem for Martin-Löf random points.
Information and Computation
210, pp 21-30, 2012.
[pdf]
[J9]
How powerful are
integer-valued martingales?
Theory of Computing Systems 51(3), pp 330-351, 2012.
[pdf]
[J8]
Algorithmic tests and
randomness with respect to a class of
measures.
Proceedings of the Steklov
Institute of Mathematics 274, pp 41-102, 2011.
[pdf]
[J7]
Separations of
non-monotonic randomness notions.
Journal of Logic and Computation 22(4), pp 701-715, 2012.
[pdf]
[J6]
Randomness and lowness
notions via open covers.
Annals of Pure and Applied Logic 163(5), pp 506-518, 2012.
[pdf]
[J5]
Limit complexities revisited.
Theory of Computing
Systems 47(3), pp 720-736, 2010.
Note: the open question at
the end of the paper was solved by Chris Conidis in
his paper ``Effectively approximating measurable
sets by open sets''.
[pdf]
[J4]
Kolmogorov-Loveland stochasticity and Kolmogorov complexity.
Theory of Computing
Systems 46(3), pp 598-617, 2010.
[pdf]
[J3]
A simple proof of the Miller-Yu theorem.
Fundamenta Informaticae
83(1-2), pp 21-24, 2008.
[pdf]
[J2]
Constructive dimension and Turing degrees.
Theory of Computing
Systems 45(4), pp 740-755, 2009.
Note: Corrects an error made in the
conference version [C4] (the claim that we can do wtt
reductions is false).
[pdf]
[J1]
Constructive equivalence relations on computable probability measures.
Annals of Pure and Applied
Logic 160, pp 238-254, 2009.
[pdf]
Conference papers
[C18]
On low for speed oracles.
35th International Symposium on Theoretical Aspects of Computer Science (STACS 2018), Schloss
Dagstuhl - LIPIcs 96, pp. 15:1-15:13, 2018.
[C17]
What percentage of programs halt?
42nd International Colloquium on Automata,
Languages and programming (ICALP 2015), pp 219-230, 2015.
Note: preliminary version of [J21].
[C16]
Algorithmic identification of probabilities is hard.
25th International Conference on Algorithmic Learning Theory (ALT 2014), pp 85-95, 2014.
[C15]
von Neumann's biased
coin revisited.
27th ACM/IEEE Symposium on Logic in Computer Science (LICS 2012), pp 145-154, 2012.
[pdf]
[C14]
The Denjoy alternative for computable functions.
29th Annual Symposium on
Theoretical Aspects of Computer Science (STACS 2012), Schloss
Dagstuhl - LIPIcs 14, pp 543-554, 2012.
[pdf]
[C13]
Solovay functions and K-triviality.
28th Annual Symposium on
Theoretical Aspects of Computer Science (STACS 2011), Schloss
Dagstuhl - LIPIcs 9, pp 452-463, 2011.
[pdf]
[C12]
Ergodic-type characterizations of algorithmic randomness.
6th Conference on Computability in Europe
(CiE 2010), LNCS
6158, pp 49-58, 2010.
[pdf]
[C11]
How powerful are
integer-valued martingales?
6th Conference on Computability in Europe
(CiE 2010), LNCS
6158, pp 59-68, 2010.
[pdf]
[C10]
Separations of non-monotonic randomness notions.
6th International Conference on Computability and Complexity
in Analysis (CCA
2009), Schloss Dagstuhl, OASICS 11, 2009.
[pdf]
[C9]
Kolmogorov complexity and Solovay functions.
26th Annual Symposium on Theoretical
Aspects of Computer Science (STACS
2009), Schloss Dagstuhl - LIPIcs 3, pp
147-158, 2009.
[pdf]
[C8]
Sparse sets.
1st Symposium on Cellular Automata ``Journées Automates
Cellulaires'' (JAC
2008), MCCME Publishing House, pp 18-28, Moscow, 2008.
[C7]
Limit complexities revisited.
25th Annual Symposium on Theoretical
Aspects of Computer Science (STACS
2008), Schloss Dagstuhl - LIPIcs 1, pp
73-84, 2008.
Note: preliminary version of [J5].
[C6]
Reconciling data compression and Kolmogorov complexity.
34th International Colloquium on Automata,
Languages and programming (ICALP
2007), LNCS 4596, pp 643-654, 2007.
[pdf]
[C5]
The dynamics of cellular automata in shift-invariant topologies.
11th International Conference Development
in Language Theory (DLT
2007), LNCS 4588, pp 84-95, 2007.
[pdf]
[C4]
Constructive dimension and weak truth-table degrees.
3rd Conference on Computability in Europe
(CiE 2007), LNCS
4497, pp 63-72, 2007.
Note: contains an error, corrected in the journal version [J2].
[C3]
Kolmogorov-Loveland stochasticity and Kolmogorov complexity.
24th Annual Symposium on
Theoretical Aspects of Computer Science (STACS 2007), LNCS 4393, pp
260-271, 2007.
Note: preliminary version of [J4].
[C2]
Effective randomness for computable probability measures.
3rd International Conference on
Computability and Complexity in Analysis (CCA 2006), ENTCS 167, pp
117-130, 2007.
Note: this paper
is merged with [C1] in the journal paper [J1].
[C1]
Constructive equivalence relations on computable probability measures.
1st International Computer Science
Symposium in Russia (CSR
2006), LNCS 3967, pp. 92-103, 2006.
Note: this paper
is merged with [C2] in the journal paper [J1].
Surveys
[S3]
Random semicomputable reals revisited.
Computation, Physics and Beyond , LNCS 7160, pp. 31-45, 2012.
[S2]
Une brève introduction à la théorie effective de l’aléatoire.
Gazette des
mathématiciens 123, Société
Mathématique de France,
January 2010.
[pdf]
[S1]
On the history of martingales in the study of randomness.
Electronic Journal for
History of Probability and
Statistics 5(2), June 2009.
[pdf]
Misc
Game-theoretic
characterizations of randomness: unpredictability
and stochasticity.
PhD dissertation,
Université de Provence
(Aix-Marseille 1), April 2008.
Note: Winner of the Gilles Kahn
thesis prize 2008.
[pdf]
[TEL]