## Welcome to IRIF

IRIF, the Research Institute on the Foundations of Computer Science, is a research laboratory of CNRS and université Paris-Diderot, also hosting two INRIA project-teams.

The research conducted at IRIF is based on the study and understanding of the foundations of all computer science, in order to provide innovative solutions to the current and future challenges of digital sciences.

IRIF hosts about 200 people. Six of its members have been distinguished by the European Research Council (ERC), five are members of the Institut Universitaire de France IUF), and two are members of the Academia Europæa.

## Notion of the day

## News

*10.9.2019*

IRIF is seeking excellent candidates for about **10 postdoctoral positions** in all areas of the Foundations of Computer Science. Deadline for applications: **Nov. 3, 2019**.

*16.10.2019*

On **December 16th**, a half-day of talks aimed at a non-specialized audience will take place at IRIF in celebration of **Algorithms**, the research domain of Claire Mathieu, 2019 recipient of a **CNRS Silver Medal**. The event will conclude with a discussion of new research directions in Algorithms. Free Registration before November 30th.

*23.9.2019*

Giuseppe Castagna (IRIF) and Jeremy Siek (Indiana) organize WGT 2020, the first *ACM SIGPLAN Workshop on Gradual Typing*, colocated with POPL. Submission deadline: Monday, October the 21st.

*8.10.2019*

The SODA 2020 conference will include a paper by Vincent Cohen-Addad (LIP6), Frederick Mallmann-Trenn (King's College) and Claire Mathieu (IRIF) about computing with noisy data. The problem: select valuable objects in a setting where each assessment has a probability of error, using redundant assessments.

*8.10.2019*

From ancient history to quantum, learn about cryptography at “Fête de la science” in an entertaining talk by Sylvain Perifel (IRIF) **Friday October 11th, 11am**
at Amphitheater 4C, Halle aux farines.

*1.10.2019*

IRIF has the great pleasure to welcome a **new research scientist** (CNRS): **Geoffroy Couteau**, an expert in cryptography, with a focus on secure computation protocols and zero-knowledge proofs.

*2.10.2019*

IRIF has the great pleasure to welcome a **new associate professor** (Université de Paris): Hugo Férée, an expert in various aspects of complexity theory, with interests in programming languages and formal proofs.

*25.9.2019*

IRIF has the great pleasure to welcome a **new associate professor** (Université de Paris): Sam Van Gool, an expert in algebraic and topological methods for automata, logic, and model theory.

(These news are displayed using a randomized-priority ranking.)

## Events

Verification

Monday October 21, 2019, 11AM, Salle 1007

**Mohamed Faouzi Atig** (Uppsala University) *On Solving String Constraints*

Graphs

Tuesday October 22, 2019, 2PM, Salle 3052

**Michael Lampis** (Universite Paris Dauphine) *Finer Tight Bounds for Coloring on Clique-Width*

Special talks

Tuesday October 22, 2019, 7PM, 3052

**Hao Huang** (Emory University) *A proof of the Sensitivity Conjecture. (live projection of TCS+ talk)*

This is a live video projection of a TCS+ talk. Live questions should be possible.

IRIF Cake

Thursday October 24, 2019, 5PM, In front of room 3052

**Cédric Ho Thanh** (IRIF Cake^{TM}) *Gâteau de l'IRIF*

^{TM}is an amazing opportunity to meet people while simultaneously eating cakes baked by your fellow colleagues! Join us every Thursday, at 5pm, in front of room 3052 (Sophie Germain 3rd floor) for a weekly feast. You can also express your cooking skills and volunteer to bake a cake by sending an email to cake@irif.fr.

Automata

Friday October 25, 2019, 2:30PM, Salle 3052

**Luca Reggio** (Mathematical Institute, University of Bern) *Limits of finite structures: a duality theoretic perspective*

I will explain how this embedding into a space of measures dually corresponds to enriching First-Order Logic with certain probability operators. Further, I will relate this construction to first-order quantification in logic on words.

This talk is based on joint work with M. Gehrke and T. Jakl.