1.
Secret key
agreement from correlated data, with no prior information,
STACS 2020, Montpellier,
France, March 12, 2020
2.
Data
communication in the framework of Kolmogorov complexity,
3.
On the path
to minimal-length descriptions, guided by Kolia and
Sasha,
4.
An
operational characterization of mutual information in algorithmic information
theory (slides),
ICALP, July 10, 2018,
Prague.
5.
Kolmogorov
complexity version of Slepian-Wolf coding (slides),
STOC 2017, June 19, 2017,
Montreal.
6.
On efficient
compression at almost minimal description length (slides),
Capital Area Theory Day,
Johns Hopkins Univ., Baltimore, May 26, 2016.
7.
Distributed
compression- the algorithmic-information-theoretical view (slides),
(video),
Nexus of Information and Computation
Theories, Distributed Computation and
Communication Theme, Institute Henri Poincare, Paris, February 1 – 12, 2016.
8.
Polynomial time
algorithms in Kolmogorov complexity theory (slides),
CCR 2015, June 22-26, 2015, Heidelberg.
9.
On the
complexity of strings and the power of randomized algorithms (slides),
Univ. of Bucharest, March 28,
2014.
10. Short lists
with short programs in short time (slides),
CCC 2013, Stanford University,
2013.
11.
On the
optimal compression of sets in P, NP, P/poly, PSPACE/poly (slides) (video),
CCR 2012, Isaac Newton Institute, July 2-6,
2012, Cambridge, UK.