Randomness, Information & Complexity
Aléatoire, information et complexité

19 – 23 February, 2024


Scientific Committee 
Comité scientifique 

Laurent Bienvenu (CNRS, Université de Bordeaux)
Michal Koucky (Charles University)
Elvira Mayordomo (University of Zaragoza)
Wolfgang Merkle (Heidelberg University)
Andrei Romashchenko (CNRS, Université de Montpellier)
Alexander Shen (CNRS, Université de Montpellier)
Linda Westrick (Pennsylvania State University)

Organizing Committee
Comité d’organisation

Sylvain Périfel (Université Paris Cité)
Andrei Romaschenko (CNRS, Université de Montpellier)
Alexander Shen (CNRS, Université de Montpellier)
Guillaume Theyssier (CNRS, Aix-Marseille Université)

IMPORTANT WARNING:  Scam / Phishing / SMiShing ! Note that ill-intentioned people may be trying to contact some of participants by email or phone to get money and personal details, by pretending to be part of the staff of our conference center (CIRM).  CIRM and the organizers will NEVER contact you by phone on this issue and will NEVER ask you to pay for accommodation/ board / possible registration fee in advance. Any due payment will be taken onsite at CIRM during your stay.

Various connections between information and computation theory are studied since many decades. A notion of algorithmic (Kolmogorov) complexity that uses computation theory to measure information in finite objects (instead of random variables) appeared in 1960s and became by now a standard tool. There are many examples of problems where information-theoretic tools like Shannon’s entropy were used to analyze complexity of algorithms and prove lower 17  bounds. Now, several directions of research based on theses connections are currently active: communication and information complexity, complexity and dimensions, complexity vs compression, pseudo-random structures, complexity of computation and Kolmogorov complexity, and randomness and computability theory. The goal of this week is to gather experts from all of these directions, who share a common general view on randomness, information and complexity.


Eric Allender (Rutgers University)
Laurent Bienvenu (CNRS, Université de Bordeaux)
Mark Braverman (Princeton University)

Lance Fortnow (Illinois Institute of Technology)
Noam Greenberg (Victoria University of Wellington)
Mathieu Hoyrup (INRIA, Université de Lorraine)
Valentin Kabanets (Simon Fraser University)
Michal Koucky (Charles University)
Sophie Laplante (Université Paris Cité)
Jack Lutz (Iowa State University)
Troy Lee (University of Technology Sydney)
Elvira Mayórdomo (University of Zaragoza)
André Nies (University of Auckland)
Igor Oliveira (University of Warwick)
Sylvain Perifel (Université Paris Cité)
Anup Rao (University of Washington)
Tatiana Starikovskaya (École Normale Supérieure de Paris)
Don Stull (Northwestern University)
Luca Trevisan (Bocconi University)
Linda Westrick (Pennsylvania State University)