Miklós Santha

21.10.2020
A paper by Troy Lee, Miklós Santha (IRIF CNRS member), and Shengyu Zhang on quantum algorithms for graph problems with cut queries will be presented at SODA2021.

Geoffroy Couteau

21.10.2020
A paper by E. Boyle, G. Couteau (IRIF CNRS researcher), N. Gilboa, Y. Ishai, L. Kohl and P. Scholl has been resented at the conference CRYPTO2020 on how to securely generate bounded amounts of correlated randomness.

Liat Peterfreund

15.10.2020
Liat Peterfreund (former IRIF postdoc, 2019-20) is one of the recipients of the L'Oréal-Unesco award for women in science. Liat is studying the science of data processing: how to extract data, how to classify it and, above all, how to make it meaningful.

IRIF

2.10.2020
IRIF is seeking excellent candidates for about 10 postdoctoral positions in all areas of the foundations of Computer Science. Deadline for applications: Nov. 2, 2020.

Adrian Vladu

1.10.2020
IRIF has the great pleasure to welcome a new research scientist (CNRS): Adrian Vladu, an expert in continuous optimization, which he uses to develop improved algorithms for combinatorial problems and methods for machine learning.

Preuves, Programmes et Systèmes

30.9.2020
This year's PPS days will take place online on October 1, 8, and 15, each time between 10:20 and 12:30.

PARIS REGION

21.9.2020
Via DIMs of Math and Infos, IRIF is one of the lab of the Paris Region Fellowship Program, a project aimed at strengthening the research capacity and international influence of Paris region, attracting excellent researcher and fostering innovation.

Mikael Rabie

15.9.2020
IRIF has the great pleasure to welcome a new associate professor (Université de Paris): Mikael Rabie, an expert in Distributed Computing, in particular on population protocols and distributed models on graphs.

Thomas Vidick

11.9.2020
Thomas Vidick will give a series of lectures on Interactive proofs with quantum devices during his stay at IRIF funded by an FSMP chair, starting on Sep. 22 at IHP.

Baptiste Louf

4.9.2020
Baptiste Louf (just graduated from IRIF) has a paper co-authored with Thomas Budzinski published in Inventiones Mathematicae that proves a conjecture of Benjamini & Curien in discrete random geometry.

Numeration - OWNS

1.9.2020
The One World Numeration Seminar is an international online seminar on numeration systems and related topics organised by Wolfgang Steiner (IRIF). It has been well accepted by the community, and the second season starts with a talk by Bill Mance on September 1st.

perso-delia-kesner.jpg

28.8.2020
Delia Kesner (IRIF) will be on the panel of a debate on the future of the conference system in theoretical computer science, and organized as a special event as part of the Online Worldwide Seminar on Logic and Semantics (OWLS). The event will take place September 2, 5pm on Zoom.

Thomas Vidick

18.8.2020
IRIF is very pleased to host for 12 months starting in September 2020, Thomas Vidick, professor of computer science and mathematics at the California Institute of Technology. His research is at the interface of theoretical computer science, quantum information and cryptography. The invitation is funded by an FSMP chair together with DIENS, Inria and IRIF. Meet him in office 4024.

Iordanis Kerenidis

18.8.2020
Iordanis Kerenidis (IRIF) was an invited speaker at International Conference on Machine Learning (ICML) in July 2020 for a talk on Quantum Machine Learning: prospects and challenges followed by a discussion with other experts in the field. Watch him online.

David Peleg

18.8.2020
IRIF is very pleased to host for 4 months starting on March 2021, David Peleg, professor at the Weitzmann Institute of Science whose research focuses on algorithms, communication networks, complex and distributed systems on a chair funded by FSMP.

Enka Blanchard

16.7.2020
Enka Blanchard, Ph.D. student at IRIF supervised by Nicolas Schabanel and Ted Selker, was awarded the PSL prize in the category “interfaces between humanities and sciences” for her Ph.D. work entitled “Usability low tech, high security”.

6.7.2020
The members of the CS department and the laboratory IRIF of Université de Paris voted in favor of a motion requesting the withdrawal of the LPPR project.

Tommaso Petrucciani

25.6.2020
Tommaso Petrucciani is awarded the GPL PhD Thesis Prize (Software Engineering and Programming) for his thesis“ “Polymorphic set-theoretic types for functional languages” prepared at IRIF co-supervised by Giuseppe Castagna (IRIF) and Elena Zucca (Università di Genova).
Polymorphism and set-theoretic types

A function is polymorphic when it can be applied to arguments of different types. For instance, the identity function fun x = x is polymorphic since it can be applied, say, to integers and Boolean arguments, while the successor function fun x = x+1 is not, since it can be applied only to integers. The latter function has type Int→Int, while the former has type ∀α.α→α, that is, it has type α→α for all possibles types α. The last type is a polymorphic type. Set theoretic types are types with union, intersection, and negation connectives: again fun x = x has both type Int→Int and Bool→Bool and, thus, it has the intersection type (Int→Int)∩(Bool→Bool).
Sylvain Schmitz

22.6.2020
Sylvain Schmitz (IRIF) co-organizes the 14th International Conference on Reachability Problems (RP'20), that is planned to take place either online or at IRIF on October 19-20.

Amos Korman

22.6.2020
Amos Korman (IRIF) will give a talk for receiving the 2020 prize of innovations in distributed computing. It will be broadcast live on Tuesday, June 30, at 7-8 pm (CET). Watching the talk is free of charge, but registration is required.

FSCD

15.6.2020
Members of IRIF organize the fifth International Conference on Formal Structures for Computation and Deduction (FSCD) and its affiliated workshops. The event was planned in Paris, due to the pandemic, it is now an online conference held from 06-29 to 07-06.

Sciences POP

22.5.2020
Jean Krivine (IRIF) discusses how to model an epidemy with Samuel Alizon (MIVEGEC) in a video for Sciences Pop’ Saint-Denis, an association for popular education.

Amos Korman

20.5.2020
Amos Korman (IRIF) has been awarded the 2020 Prize for Innovation in Distributed Computing. The prize will be given during the SIROCCO 2020 conference in July.

Simon Mauras

11.5.2020
IRIF PhD student Simon Mauras had a paper accepted at the EC 2020 conference, “Two-Sided Random Matching Markets: Ex-Ante Equivalence of the Deferred Acceptance Procedures”

11.5.2020
An online ANR-HOSIGRA 2020 meeting will be held on Tuesday May 12, 14:00-17:00 with a possibility of further discussions on the following days. If interested in joining the meeting, please contact Reza Naserasr.

Theoretical Computer Scientists for Future

11.5.2020
Thomas Colcombet and Hugo Férée (IRIF) together with Antoine Amarilli and Thomas Schwentick administrate the website for the TCS4F Manifesto, an initiative to reduce the carbon footprint related to Theoretical Computer Science research activities.

Numeration - OWNS

30.4.2020
The One World Numeration Seminar, a new international online seminar on numeration systems and related topics, is organised by Wolfgang Steiner (IRIF) and hosted at IRIF. It starts on May 5 with a talk by Narad Rampersad.

Raphaëlle Crubillé

27.4.2020
At ICALP'20, Raphaëlle Crubillé (IMDEA Software Institute and IRIF), with Boaz Barak and Ugo Dal Lago take a look at how higher-order cryptography could look like, giving both positive and negative results on higher-order generalizations of pseudorandomness constructions.

Claire Mathieu

27.4.2020
Claire Mathieu (IRIF) has been interviewed by the online news site of CNRS about using graphs to devise a lockdown exit strategy.

Frédéric Magniez

23.4.2020
In the context of quantum cloud computing, Frédéric Magniez (IRIF) with Ashwin Nayak (U. Waterloo) will introduce at ICALP'20 a fundamentally new and more efficient solution than classical ones to decide if there is inconsistency between 2 or more remote quantum databases.

Pierre Fraigniaud

23.4.2020
Pierre Fraigniaud (IRIF) and Ami Paz (U. Vienna, Austria) will virtually present at ICALP'20 how to model distributed computing in networks in the framework of algebraic topology, where algorithms are characterized as simplicial maps between complexes.

23.4.2020
Thomas Colcombet (IRIF) with David Barozzini, Lorenzo Clemente and Paweł Parys (Univ Warsaw) will virtually present at ICALP'20 how to compute downward closures of safe recursion schemes, objects that give meaningful information about the behavior of higher order programs. This paper got the best paper award of ICALP/Tack-B.

LICS

20.4.2020
Six papers coauthored by IRIF members will be presented at the prestigious conference LICS'20 this summer. Topics include the semantics of probabilistic and nondeterministic programming languages, as well as extensions of the proof-program correspondence to classical logic.

EATCS

17.4.2020
Four papers coauthored by IRIF members will be presented at the prestigious conference ICALP'20 this summer. Topics include automata, cryptography, networks, and quantum computing.

John Horton Conway

15.4.2020
John Horton Conway passed away at 82 on 04-11 from COVID. Mathematician with an impressive spectrum of expertise, his influence on theoretical computer science is decisive from cellular automata to paving. Valérie Berthé (IRIF) wrote a note for La Recherche.
John Conway's Game of Life

IRIF

7.4.2020
All seminars of IRIF are now active again through BigBlueButton, an open source solution installed on our local servers thanks to our amazing staff support. Check out our page about seminars for more information.

OCaml-Software-Foundation

7.4.2020
The OCaml MOOC developed by Ralf Treinen, Roberto Di Cosmo and Yann Régis-Gianas from IRIF is reopened during COVID19 sheltering. Use this time at home to learn functional programming!

IRIF

7.4.2020
The first virtual workshop co-organized by a member of IRIF, Valérie Berthé, took place March 23-27 on Multidimensional Continued Fractions and Euclidean Dynamics. All talks have been recorded and are publicly accessible.

PLDI 2020

27.2.2020
Two papers co-authored by IRIF members will be presented at PLDI'20, the main conference on implementations of programming languages. The papers propose new methodologies for verifying distributed protocols and smart contracts running on top of blockchains, respectively.

7.2.2020
IRIF will finance one or two additional Master scholarships in Foundations of Computer Science within the PGSM program of FSMP for female students who have completed a bachelor’s degree or the first year masters in one of the universities of the FSMP network. Apply by May 8th.

kaleidoscope.jpg

6.2.2020
Sylvain Périfel from IRIF, together with Damiano Mazza and Thomas Seiller, organize the Caleidoscope Research School in Computational Complexity, to be held in Paris (postponed to 2021).

JFLA 2020

30.1.2020
Yann Régis-Gianas (IRIF) is the vice-president of the “Journées Francophones des Langages Applicatifs” that will take place at Gruissan from the 29th of January to the 1st of February.

27.1.2020
The ANR PPS kick-off meeting will take place from Feb 26 to Feb 28, 2020 at IRIF (Paris) and will be joined with the 3rd edition of the PIHOC workshop series initiated by Ugo Dal Lago in 2018 and with Dal Lago's DIAPASoN ERC project kick-off meeting. Register by Jan 31: registration is free but mandatory.

21.1.2020
The ASD day of « Algorithms and discrete structures » pole will take place in room 3052 on January 27th.

Emilio J. Gallego Arias

15.1.2020
IRIF has the great pleasure to welcome a new starting researcher (Inria): Emilio J. Gallego Arias, an expert in interactive theorem proving and the Coq proof assistant.

Report about Quantum Technologies

13.1.2020
Iordanis Kerenidis, CNRS senior researcher (IRIF) and director of the Paris Centre for Quantum Computing, is one of the three authors of the report about Quantum Technologies requested by the French government.

Matthieu Josuat-Vergès

10.1.2020
IRIF has the great pleasure to welcome a new research scientist (CNRS): Matthieu Josuat-Vergès, an expert in enumerative combinatorics and algebraic combinatorics.

Université de Paris

10.1.2020
Université de Paris has opened one permanent associate professor position in Computer Science. Recruited researcher will join IRIF. Apply by April 9th, 4pm (Paris time).

SODA20

7.1.2020
Guillaume Ducoffe (Bucarest Univ. and ICI) will present at SODA’20 a result obtained with Michel Habib (IRIF) and Laurent Viennot (IRIF and Inria) showing that diameter can be computed in truly sub-quadratic time in any H-minor free graph. This extends a recent breakthrough on planar graphs.

SODA20

7.1.2020
Claire Mathieu and Simon Mauras (IRIF) will present at SODA’20 several approximation algorithms for top-list aggregation, an optimization problem from the field of information retrieval: compute the output full-ranking which is closest to a collection of input top-lists.

Institut de France

23.12.2019
IRIF is proud to announce that Claire Mathieu, senior research scientist at IRIF, has been elected at the Académie des sciences for the section of mechanical engineering and computer science.

Société Informatique de France

13.12.2019
Raphaëlle Crubillé (former student at IRIF)‬⁩ was awarded the Gilles Kahn 2019 prize for her PhD thesis entitled « Behavioral Distances for Probabilistic Higher-order Programs » supervised by Thomas Ehrhard (IRIF) and Ugo Dal Lago.

POPL20

11.12.2019
Two papers coauthored by IRIF members will be presented at POPL’20, the main conference on programming languages and programming systems. The papers' topics are reflecting Coq in Coq and how to differentiate higher-order programs.

Michele Pagani

10.12.2019
Michele Pagani (IRIF), Alois Brunel (Deepomatic) and Damiano Mazza (LIPN) will present at POPL'20 an effect-free extension of the backpropagation algorithm to higher-order functional programming, allowing for a logical understanding of its dynamics thanks to linear logic.

Yann Régis-Gianas

20.11.2019
Yann Regis-Gianas (IRIF) co-organizes at IRIF the workshop “Tezos Smart Contrat Languages and Formal Verification” on the 21 and 22 of November. Registration is free but mandatory.

SIRTEQ

7.11.2019
What are near-term quantum computers good for? Iordanis Kerenidis (IRIF) will give a talk on 11/29 in a meeting organized by the DIM Sirteq where Google will present its recent results about quantum supremacy. Registration is free but mandatory.

1.11.2019
IRIF hosts the annual meeting of the molecular bioinformatics research group of CNRS (GDR BIM) from 11-05 to 11-07.

Collège de France

29.10.2019
Walter FONTANA (MedSchool Harvard) holds the annual chair of Collège de France on the theme “Life and the Computer: The Challenge of a Science of Organization”. The lectures and seminars started since the 10-24. Jean Krivine (IRIF) will give a seminar the 11-22.

Marie Kerjean

23.10.2019
Marie Kerjean (former IRIF PhD student) is one of the recipients of the L'Oréal-Unesco award for women in science. Marie is building a bridge between logic, programming, and physics using functional analysis to model proofs, and types to understand analysis.

perso-claire-mathieu.jpg

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.

Sylvain Perifel

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.

IRIF

8.10.2019
Researchers of IRIF are participating in the “Fête de la Science”! Meet them at the University of Paris October 10-11 to better understand the first principles of computing!

IRIF Distinguished Talks Series

8.10.2019
Talks of the IRIF Distinguished Talks Series for the coming academic year have been scheduled. Save the dates: January 24, March 20 and June 20. Speakers will be Martin Grohe (RWTH Aachen University), Joseph Mitchell (State University of New York at Stony Brook), Simon Peyton Jones (Microsoft Research at Cambridge, England).

Claire Mathieu

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.

Hugo Férée

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.

Geoffroy Couteau

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.

Sam Van Gool

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.

SODA20

25.9.2019
Three papers coauthored by IRIF members will be presented at SODA’20, the main conference in algorithm design. Topics include the study of noisy models, aggregate rankings, and graph diameters.

Valia Mitsou

24.9.2019
IRIF has the great pleasure to welcome a new associate professor (Université de Paris): Valia Mitsou, an expert in algorithms and complexity, particularly in structural parameterizations and fine grained complexity.

Sylvain Schmitz

24.9.2019
IRIF has the great pleasure to welcome a new professor (Université de Paris): Sylvain Schmitz, an expert in logic and verification, and especially in problems of astronomical computational complexity.

Workshop on Gradual Typing

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.
gradual typing

Gradual typing is a technique that allows the programmer to control which parts of a program check their type correctness (i.e., that apples are added to apples) before execution and which parts check it during their execution instead. It is often used to gradually add the before-execution check to dynamic languages, like JavaScript, which perform the check only at run-time, since it is generally better to find errors before the execution of a program rather than during its execution.
perso-leonid-libkin.jpg

18.9.2019
From September 30th to October 21st, Leonid Libkin (University of Edinburgh) will give a series of 7 courses related to his FSMP Chair on the topic of A modern theory of database query languages each Friday 10:30-12:00 at IRIF, room 3052.

17.9.2019
IRIF is having its back-to-work-day on October 1st. In the morning, there will be a welcome session for new PhD students, postdocs and TA, and in the afternoon a series of talks given by new faculty and CNRS members.

perso-giuseppe-castagna.jpg

17.9.2019
Giuseppe Castagna (IRIF) and his coauthors Mariangiola Dezani, Elena Giachino, and Luca Padovani (Università di Torino) will receive on October the 8th at PPDP 2019 the Most Influential Paper 10-Year Award for their paper Foundation of Session Types presented at PPDP 2009.
Session Types

Session types can be thought of as “types for protocols”, insofar as they describe all the possible sequences of interactions between services, together with the type of the information exchanged in these interactions. Programs can be checked to see if the processes they implement conform to the protocols described by a session type.

11.9.2019
A. Balliu and D. Olivetti (former IRIF PhD students), J. Hirvonen and M. Rabie (former IRIF postdocs), with S. Brandt and J. Suomela broke an old lower bound open question on Maximal Matchings. Their paper will be presented at FOCS as Best Paper.

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.

Patrick Dehornoy

6.9.2019
It is with great sadness that we learnt the passing of our collegue Patrick Dehornoy on September the 4th. IRIF had the chance to count this exceptional mathematician amongst its associate members. He will be terribly missed by all his colleagues and it is a great loss for the whole scientific community.

Leonid Libkin

3.9.2019
IRIF has the great pleasure to welcome Leonid Libkin, professor at University of Edinburgh, who is visiting for three months. His stay is financed by an FSMP chair. Leonid is an expert in data management and applications of logic in computer science. Meet him in office 4048.

Preuves, Programmes et Systèmes

26.8.2019
The PPS days will happen in the Turing amphiteater the 2nd and 3rd of September.

14.7.2019
A workshop on Graph Compression and Compact Representations will take place at IRIF on September 9-10. Submit your talk proposal before the 25th of August.

perso-pierre-louis-curien.jpg

14.7.2019
A scientific meeting in honor of Pierre-Louis Curien will take place at IRIF, in the amphiteater 4C, Halle aux Farines building on the 6th of September. Registration is free but mandatory.

Laboratoire IRIF: Institut de Rechecrche en Informatique Fondamentale

28.6.2019
IRIF is celebrating the end of the academic year on the 4th of July at Amphi Pierre-Gilles de Gênes, building Condorcet with a talk at 4.00 by Emmanuelle Frenoux about computer science and the environment, and another at 5.00 by Anne Siegel about gender balance.

21.6.2019
A summer school CIMPA entitled “Algorithmic and statistical approaches to machine learning” co-organized by Vlady Ravelomanana will take place at the University of Antananarivo from the 16th to the 25th of July 2019.

Kamil Khadiev

11.6.2019
Kamil Khadiev from Kazan University, an expert in complexity and quantum computing, is visiting IRIF from June 10th to July 9th.

Conference CAV'19

30.5.2019
Four papers coauthored by IRIF members will be presented at the prestigious conference CAV'19 in New York this summer. Topics include verifying weakly-consistent distributed databases, testing cache coherence protocols, and testing concurrent objects.

perso-mikael-rabie.jpg

25.5.2019
Mikaël Rabie (Postdoc at IRIF) will present at ICALP'19 a new problem, about distributed reconfiguration of maximal independent sets, providing an optimal algorithm to produce a reconfiguration schedule in the LOCAL model. This work, receiving Best Paper award in Track C, is a joint work with Keren Censor-Hillel from the Technion (Haifa, Israël).

Institut Universitaire de France

10.5.2019
IRIF is proud to announce that Constantin Enea, associate professor of Université de Paris and researcher at IRIF, was appointed junior member of IUF. This appointment will allow him to develop a research project concerning rigorous engineering of distributed databases.

logo-cirm.jpg

9.5.2019
Claire Mathieu, Amaury Pouly and Yann Régis-Gianas from IRIF gave talks at the conference of French preparatory schools to science and engineering curriculum in May 6-10, contributing to the ongoing important changes in Computer Science education in French high-schools and higher-education systems.

7.5.2019
Claire Mathieu from IRIF explained what algorithms are and what is their history to a national French radio broadcast show about Philosophy.

EATCS

26.4.2019
Seven papers coauthored by IRIF members will be presented at the prestigious conference ICALP'19 in Patras this summer. Topics include automata, games, graphs, quantum computing, randomized complexity, and semigroups.

23.4.2019
The Spring session of Graph Theory in Paris will be held on Friday April 26 at Amphi Turing. Speakers of the event: Penny Haxell from U. Waterloo and Patrice Ossona de Mendez from CNRS.

23.4.2019
Sergio Rajsbaum from Universidad Nacional Autonoma de Mexico, a world-renowned expert in the theory of distributed computing, is visiting IRIF from March 31st to May 2nd.
Distributed systems

Distributed systems are groups of networked computers, interacting with each other in order to achieve the same goal. In parallel computing, all processors have access to a shared memory to exchange information between processors. In distributed computing, information is exchanged by passing messages between the processors. Cluster of computers and peer-to-peer systems are examples of such architectures. Models of distributed systems are also used in other science, such as in biology, in order to analyze collective behaviors of autonomous entities interacting with each other by message passing.
perso-iordanis-kerenidis.jpg

19.4.2019
Iordanis Kerenidis (IRIF) explains what we can expect from Quantum Computing in this interview of the CNRS journal.

19.4.2019
Université Paris Diderot has opened several teaching assistant positions (ATER) in Computer Science on the research topics of IRIF. Deadline to apply : May 6, 2019.

LICS

19.4.2019
Three papers coauthored by IRIF members will be presented at the prestigious conference LICS'19 in Vancouver this summer. Topics include sequent calculus, differential logic and probabilistic computation.

16.4.2019
Ali Charara, director of INS2I at CNRS, visits IRIF on the morning of April 24th. The research conducted at IRIF will be presented as well as 6 specific scientific talks. The visit will be followed by a light buffet lunch.

8.4.2019
Two IRIF members (Ahmed Bouajjani and Pierre Fraigniaud) will give a talk at the Workshop on Taking Stock of Distributed Computing at College de France, Friday April 12.

8.4.2019
We are very pleased to host as part of our IRIF Distinguished Talks Series Johan Håstad (Royal Institute of Technology, Stockholm) on April 12, 10:30 for a talk entitled “Switching lemmas in the 80ies and today”.

Penny Haxell

5.4.2019
Penny Haxell from University of Waterloo (Canada), a world wide expert in extremal combinatorics and graph theory, is visiting IRIF March 28th to May 2nd.
Extremal combinatorics

Extremal combinatorics studies how large or how small a collection of finite objects can be, if it has to satisfy certain restrictions. For instance, in an n-element set, what is the largest number of subsets of which none contains any other? The question is answered by Sperner's theorem, which gave rise to much of extremal set theory. Another kind of example: How many people can we invite to a party where among each three people there are two who know each other and two who don't know each other? Ramsey theory shows that at most five persons can attend such a party.
ANR project DISTANCIA

26.3.2019
The ANR project DISTANCIA about graph metrics is organizing a workshop at IRIF on the 27, 28 and 29 of March in room 366A of Bâtiment Condorcet.

Ile de France

17.3.2019
The Paris Region PhD2 program will grant 30 PhD projects on Digital Sciences and with an industrial partner. IRIF is an eligible hosting lab. Call for application is open until May, 15th 2019.

Uri Zwick

15.3.2019
From March 20th to May 22nd, Uri Zwick (Univ. of Tel Aviv) will give a series of 7 courses related to his FSMP Chaire of Excellence on the topic of Games on Graphs and Linear Programming Abstractions each Wednesday 2:15pm - 4:15pm at IRIF, room 3052.
Linear programming

Linear programming is a technique for the optimization of a linear function, subject to linear equality and linear inequality constraints. A linear programming algorithm finds a point in the polyhedron of feasible solutions satisfying those constrains, where this function has the smallest (or largest) value. Linear programming is widely used in industries, including transportation, energy, telecommunications, and manufacturing, for diverse types of tasks such as planning, routing, scheduling, assignment, and design.

14.3.2019
Université Paris Diderot has opened four permanent positions in Computer Science (1 professor and 3 assistant professors). Recruited researchers will join IRIF.

14.3.2019
FSMP offers 21 PhD student positions in Maths and TCS under H2020 COFUND project MathInParis. As a member of the FSMP network, IRIF is an eligible hosting lab. Call for application is open until April, 1st 2019. Applicants must be international students, but master students already in France for less than a year are eligible.

IRIF Distinguished Talks

5.3.2019
The Collège de France and IRIF are delighted to host as part of our IRIF Distinguished Talks Series Robert Tarjan (Princeton) on March 18, 17:00 for a talk entitled “Concurrent Connected Components”

Amaury Pouly

19.2.2019
Amaury Pouly (IRIF) with François Fages, Guillaume Le Guludec and Olivier Bournez were awarded the prize "La Recherche": they have shown that chemical reactions, as the ones taking place in cells, can simulate Turing machines. Chemical reactions are universal computers.

Yoav Rodeh (left) and Amos Korman (right)

15.2.2019
In collaboration with Yoav Rodeh (Weizmann Institute of Science), Pierre Fraigniaud and Amos Korman from IRIF published a paper in the Journal of the ACM entitled “Parallel Bayesian Search with no Coordination”.

Fabian Reiter

15.2.2019
Fabian Reiter (former student at IRIF) wrote a short popularisation article in the Blog Binaire of the newspaper Le Monde. This article explains (in French) some aspects of his PhD thesis, recently awarded the Honorable Mention of the Gilles Kahn prize.

perso-alves.jpg

4.2.2019
IRIF has the great pleasure to welcome Sandra Alves, assistant professor at University of Porto and expert in type-theory, rewriting, and fundamental calculi, who is visiting the IRIF until the 8th of February.

Uri Zwick

1.2.2019
IRIF has the great pleasure to welcome Uri Zwick, professor at the Blavantik School of Computer Sience (University of Tel-Aviv), who is visiting for four months. His stay is financed by an FSMP chair. Uri is an expert in algorithms, data structures and games. Meet him in office 4048.

1.2.2019
Enrica Duchi and Guillaume Chapuy (IRIF) organise February the 15th in Amphi Turing, a map day (Journée cartes) dedicated to combinatorial and probabilistic aspects of maps.

1.2.2019
Carole Delporte (IRIF) will give a seminar at Collège de France as part of the annual Chair of Rachid Guerraoui (EPFL) on Distributed Algorithms, March 1.

ANR project FREDDA (FoRmal mEthods for the Design of Distributed Algorithms)

30.1.2019
The next meeting of the ANR project FREDDA (FoRmal mEthods for the Design of Distributed Algorithms) will happen at IRIF, Monday 4th and Tuesday 5th February 2019, room 3052.

CIMPA

23.1.2019
A CIMPA school on Graphs, Algorithms and Randomness is co-organized by Reza Naserasr from IRIF at Tabriz University, 15-22 June 2019. Three colleagues from IRIF, Pierre Fraigniaud, Michel Habib and Frédéric Magniez, are among the five lecturers from France.

23.1.2019
FILOFOCS (French-Israeli Laboratory on Foundations of Computer Science), the first International Joint Unit in Israel, was just created by CNRS, Univ. Paris Diderot, Tel-Aviv Univ., Hebrew Univ. of Jerusalem and Weizmann Institute. IRIF hosts its “mirror site” in France, and Adi Rosén from IRIF is deputy director.

17.1.2019
Guillaume Chapuy and Enrica Duchi from IRIF coorganize with Christina Goldschmidt (Oxford) the Journées Aléa 2019, a CNRS thematic school about discrete random structures, from 03-18 to 03-22 at CIRM. Register by January 23.

17.1.2019
Pierre Fraigniaud from IRIF organizes the Workshop Complexity and Algorithms (CoA), in the framework of GdR IM, Roscoff, France, April 1-5, 2019. The objective of this workshop is to gather the French community on design and analysis of algorithms, of all forms. Deadlines: submission by 01/02/2019, registration by 02/03/2019.

16.1.2019
Giuseppe Castagna, Victor Lanvin, Tommaso Petrucciani from IRIF present this week at POPL19 a paper coauthored with Jeremy Siek (Indiana university) about a new formal framework for gradual typing allowing a smoother and more declarative integration of gradual typing in existing programming languages.

Pole ASV: Automates, Structures, Verification

10.1.2019
The day of the ASV pole will take place Monday January 21.

Jeremy Siek

9.1.2019
IRIF has the great pleasure to welcome Jeremy Siek, professor at Indiana University Bloomingtom, who is visiting IRIF for five months. Jeremy is the creator of gradual typing and a world-renowed expert in typed programming languages. Meet him in office 4034a.
gradual typing

Gradual typing is a technique that allows the programmer to control which parts of a program check their type correctness (i.e., that apples are added to apples) before execution and which parts check it during their execution instead. It is often used to gradually add the before-execution check to dynamic languages, like JavaScript, which perform the check only at run-time, since it is generally better to find errors before the execution of a program rather than during its execution.
Amaury Pouly

8.1.2019
IRIF has the great pleasure to welcome a new researcher (CNRS), Amaury Pouly, an expert in continuous models of computations, and the analysis and verification of continuous/hybrid dynamical systems.

1.1.2019
Christine Tasson (IRIF) will give a seminar at Collège de France as part of the lectures of Xavier Leroy (Collège de France) on Software Science, January 23.

Frédéric Magniez

21.12.2018
Frederic Magniez (IRIF) will present at QIP 2019 a quantum distributed algorithm to compute the diameter of a quantum distributed congested network. This is the first quantum distributed algorithm that overcomes classical algorithms for this task.

Fabian Reiter

19.12.2018
Fabian Reiter now at LSV was awarded the Honorable Mention of the Gilles Kahn prize for his PhD Distributed Automata and Logic supervised by Olivier Carton at IRIF.

Constantin Enea

13.12.2018
Constantin Enea (IRIF) will present at POPL 2019 a methodology for specifying software modules whose operations satisfy multiple consistency levels. This work has revealed previously unknown documentation errors and bugs in Java concurrent objects.

Ahmed Bouajjani

9.12.2018
The Alexander von Humboldt Foundation has honored Ahmed Bouajjani (IRIF) with the prestigious Carl Friedrich von Siemens Research Award, in recognition of his research contributions.

Miklos Santha and Troy Lee

3.12.2018
Maybe you are an eager bitcoin miner? Maybe you are a fan of quantum computing too, and you wonder what will change in the mining competition when done by quantum computers? Find some answers in a paper coauthored by Miklos Santha (IRIF) to be presented at ITCS’19.

1.12.2018
Hugues Fauconnier (IRIF) will give a seminar at Collège de France as part of the annual Chair of Rachid Guerraoui (EPFL) on Distributed Algorithms, December 21.

1.12.2018
Matthieu Sozeau (IRIF) will give a seminar at Collège de France as part of the lectures of Xavier Leroy (Collège de France) on Software Science, December 12.

29.11.2018
Constantin Enea from IRIF organizes with Ruzica Piskac (Yale University), the 20th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI 2019). The conference is preceded by a winter school on formal methods.

ITCS19

21.11.2018
Two papers coauthored by IRIF members will be presented at ITCS’19, a prestigious conference to promote research that carries a strong and innovative conceptual message in TCS. Topics include communication complexity and quantum dueling algorithms.

QIP19

20.11.2018
Two papers coauthored by IRIF members will be presented at QIP’19, the main conference for theoretical quantum information research. Topics include efficient quantum algorithms for both algebraic and distributed problems.

SODA19

20.11.2018
One paper coauthored by Laurent Feuilloley while he was PhD student at IRIF will be presented at SODA’19, the main conference in algorithm design. The paper provides lower bounds for the fundamental problem of text indexing with mismatches and differences using the Strong Exponential Time Hypothesis.

Mahsa Shirmohammad

19.11.2018
IRIF has the great pleasure to welcome Mahsa Shirmohammadi, researcher scientist (CNRS) from LIS, who is visiting IRIF for six months and who is an expert in the analysis and verification of timed, counter and probabilistic systems.

popl19

17.11.2018
Four papers coauthored by IRIF members will be presented at POPL’19, the main conference on programming languages and programming systems. The papers' topics are game semantics, proof theory, gradual typing, and consistency for concurrent computations.
Games, gradual typing, proofs, consistency

Games are mathematical objects used for modeling situations in which several participants/players interact, and each of them aims at fulfilling a personal goal. Real games such as chess or go are cases in which there are two players which are opponents. Games occur in computer science for modeling the logical duality between conjunction and disjunctions, or for defining particular families of complexity classes. Games appear in verification for describing how a system has to react to the environment (the opponent) in order to perform what it has been designed for.
Gradual typing is a technique that allows the programmer to control which parts of a program check their type correctness (i.e., that apples are added to apples) before execution and which parts check it during their execution instead. It is often used to gradually add the before-execution check to dynamic languages, like JavaScript, which perform the check only at run-time, since it is generally better to find errors before the execution of a program rather than during its execution.
Proof theory is the branch of mathematical logic that studies proofs as mathematical objects. In particular, proof are syntactic constructions built from axioms and inference rules. Relevant to computer science are the studies of computational and complexity aspects of proofs.
Memory consistency models characterize the effect of concurrent invocations to a library implementing a shared state, e.g., a queue or a key-value map. Strong consistency means that the results of concurrently-executed invocations match the results of some serial execution of those same invocations. Since strong consistency carries a significant penalty on performance, modern implementations provide weaker guarantees known as weak consistency models, e.g., eventual or causal consistency.

QIA

12.11.2018
IRIF and PCQC are partners in the EU Flagship project Quantum Internet Alliance (QIA) and in charge of delivering the QIA's blueprint for the future of quantum communications. The EU selected nineteen research projects, and ten of them are based on French teams.

Distinguished Talk

10.11.2018
We are delighted to host as part of our IRIF Distinguished Talks Series Maurice Helihy (Brown University) on Nov. 16, 10:30 for a talk entitled “Atomic Cross-Chain Swaps”.

GDRI

10.11.2018
The last plenary meeting of GDRI Logique Linéaire takes place at IRIF, December 3-5. The program consists of talks given by members of the GDRI.

10.11.2018
The first meeting of the French-Chinese research project Verification Interaction Proof will take place in Paris at IRIF on November 19-24. Registration is free but mandatory.

Graph Theory in Paris

9.11.2018
The first session of a series of seminars Graph Theory in Paris will be hosted by IRIF. There will be two seminars by Monique Laurent and Lex Schrijver on November 23, at 2pm, in Amphi Turing of Sophie Germain building.

logo-cirm.jpg

5.11.2018
Amélie Gheerbrand and Cristina Sirangelo from IRIF co-organize with L. Libkin, L. Segoufin, and P. Senellart, the 2019 Spring School on Theoretical Computer Science (EPIT) on Databases, Logic and Automata, to happen the 7-12 April 2019 in Marseille. Preregistration before 13 January 2019.

5.11.2018
The Journées PPS 2018 will take place on Thursday 8 and Friday 9 November, room 3052, building Sophie Germain.

Adrien Guatto

12.10.2018
IRIF has the great pleasure to welcome a new assistant professor (Paris Diderot): Adrien Guatto, an expert in synchronous languages, typed functional programming, and categorical semantics.

Pierluigi Crescenzi

12.10.2018
IRIF has the great pleasure to welcome a new professor (Paris Diderot): Pierluigi Crescenzi, an expert in graph algorithms, particularly in the analysis of real-world complex networks.

Claire Mathieu

12.10.2018
IRIF has the great pleasure to welcome a new research scientist (CNRS): Claire Mathieu, an expert in algorithms, particularly the design of approximation schemes for NP-hard combinatorial.

Daniela Petrisan

10.10.2018
IRIF has the great pleasure to welcome a new assistant professor (Paris Diderot): Daniela Petrisan, an expert in categories, co-algebra and automata.

ICFP: International Conference On Functional Programming

9.10.2018
The paper “Equivalences for Free : Univalent Parametricity for Effective Transport” of Matthieu Sozeau (IRIF), with his coauthors Nicolas Tabareau and Eric Tanter, has been selected as a distinguished paper of the ICFP conference.

CRECOGI+ELICA+GDRILL Plenary Meeting

8.10.2018
On October 8-11 IRIF organizes a joint meeting of 3 projects which are closely related: GDRI-LL, CRECOGI, and ELICA. Everybody is welcome to attend.

Maths en ville

8.10.2018
Jean Krivine (researcher at IRIF) will lead a public debate about Artificial Intelligence at the “Festival Maths en Ville” of Saint-Denis. It will take place on the 11/10/2018 at the theater “L'écran”, starting at 19.30.

7.10.2018
IRIF is having its back-to-work-day on October 15th. In the morning, there will be a PhD student session, and in the afternoon a series of talks given by new faculty and CNRS members.

Jean-Éric Pin

7.10.2018
Jean-Eric Pin, CNRS senior researcher at IRIF, is awarded the Arto Salomaa prize for his outstanding contribution to the field of Automata Theory.

IRIF

5.10.2018
IRIF is seeking excellent candidates for about 10 postdoctoral positions in all areas of the Foundations of Computer Science.

Software Heritage

4.10.2018
In an article of October of Communications of the ACM, Jean-François Abramatic, Roberto Di Cosmo (IRIF) and Stefano Zacchiroli (IRIF) explain the mission of the Software Heritage project.

WENDY: Workshop on emergent algorithms

15.9.2018
IRIF co-organizes the Workshop on Emergent Algorithms and Network Dynamics (Wendy) that will take place at Institut Henri-Poincaré in Paris on October 10-11, 2018. Registration is free but mandatory.

COmplexité et Algorithmes

14.9.2018
The October 2, IRIF organizes the next Annual workshop of the French Working Group on Complexity and Algorithms (CoA). This year, the workshop will consist of a series of introductory and survey talks about various hot topics in algorithms, including Blockchains, Machine Learning, Sum-of-Square, etc.

QUANTERA

7.9.2018
The EU QuantAlgo project workshop will be held in Paris at IRIF September 25-28, 2018. This is a joint workshop with the IRIF-IQC Cooperation project between CNRS and U. Waterloo. QuantAlgo project aims to combine research on the fundamentals of quantum algorithms with the development of new applications.

The DUALL project of the ERC

4.9.2018
IRIF organizes the workshop Quantifiers and duality that will take place at Amphi Turing (building Sophie Germain, University Paris Diderot) on the 2018/09/11. Registration is free but mandatory.

FILOFOCS: Frech-Israeli-workshop on foundations of Computer Science

9.8.2018
IRIF organizes the 7th FILOFOCS (French-Israeli Laboratory on Foundations of Computer Science) workshop which will be held at the institut Henri Poincaré (IHP), on 3-5 October, 2018. A preliminary list of speakers in now available and registration (mandatory, but free) is now open.

perso-michel-habib.jpg

1.8.2018
At the occasion of the retirement of Michel Habib and in celebration of his achievements, IRIF organizes a two-day conference “40 années d'algorithmique de graphes”, 11-12 Oct, Amphi Turing (Sophie Germain, Univ. Paris Diderot). Free mandatory registration.

FOCS

29.7.2018
IRIF organizes the 59th IEEE Symposium on Foundations of Computer Science (FOCS 2018) on October 7-9, 2018. FOCS is a leading annual conference in Theoretical Computer Science, and has served in the last 60 years as a venue for announcing the major scientific advances in the field. The list of accepted papers is now available, and the registration is now open (deadline for early rate: September 9, 2018).

FLOC18

10.7.2018
Mihaela Sighireanu (IRIF) is organizing the second edition of SL-COMP, a competition of solvers for separation logic. The final results will be presented at ADSL 2018, a workshop of FLOC2018, which will take place in Oxford on the 13.07.18.
separation logic

Separation logic is a language for describing properties and reasoning about programs that use mutable data structures (i.e. memory cells and pointers). Separation logic has a special support for local reasoning, which is the ability to use and compose properties that involve a subset of the data configuration only: it separates the relevant portion of the data structure from the irrelevant one. Local reasoning gives more compact proofs and specifications for imperative programs than with prior formalisms. Furthermore, it helps with the scalability of proofs done in automatic and semi-automatic verification and program analysis tools.
Avocs'18

6.7.2018
Mihaela Sighireanu (IRIF) is co-chair of the 18th International Workshop on Automated Verification of Critical Systems (AVOCS) which will take place in Oxford from 18.07.18 to 19.07.18 as part of FLOC2018.

LICS

29.6.2018
Raphaëlle Crubillé (PhD student IRIF) will present at LICS 2018 an analytic account of the discrete probabilities fragment of a denotational model for higher-order programming with general probabilities, hopefully a first step towards proving that this model is fully abstract.
fully abstract

The quest for a fully abstract model for the contextual equivalence of PCF, a paradigmatic functional language, has been influential in the area of programming languages semantics. A model is fully abstract if it is both sound and complete. A denotational model is complete for a given notion of equivalence between programs if equivalent programs have the same denotation, some mathematical object they are mapped to; it is sound if programs having the same denotation are equivalent.
CIJM

27.6.2018
Berenice Delcroix-Oger (IRIF) participated to the annual festival Salon Culture & Jeux Mathématiques 2018. On the following video (1:50), she presents a funny game where mathematics help you perform magic tricks!

Amina Doumane

15.6.2018
Amina Doumane (former PhD student at IRIF, now at LIP) was awarded the Ackermann prize of EACSL for her PhD thesis entitled On the infinitary proof theory of logics with fixed points.

TYPES

6.6.2018
Delia Kesner (IRIF) and Matthieu Sozeau (IRIF) will both give invited talks entitled “Multi Types for Higher-Order languages” and “The Predicative, Polymorphic Calculus of Cumulative Inductive Constructions and its implementation” at TYPES 2018, held in Braga (Portugal), June 18-21.

Softare heritage

6.6.2018
Today Roberto Di Cosmo (professor at IRIF) with a ceremony at UNESCO opened to the public the archives of Softwareheritage.org, a worldwide initiative to create a universal library of computer programme source codes since the dawn of the digital age.

IRIF Distinguished Talks

6.6.2018
We are delighted to host as part of our IRIF Distinguished Talks Series Christos Papadimitriou (Columbia University) on July 13, 10:30 for a talk entitled “A computer scientist thinks about the Brain”.

1.6.2018
Adi Rosén (IRIF) will give a talk during a 1-day colloquium at Collège de France as part of the annual Chair of Claire Mathieu (IRIF associate member) on Algorithms, June 7.

Collège de France

1.6.2018
Claire Mathieu (IRIF associate member) organizes a 1-day colloquium on Approximation algorithms and networks at Collège de France on June 7. This is part of the Chair in Informatics and Computational Sciences at College de France in association with INRIA.
approximation algorithm

The approximation algorithms are algorithms that produce a solution that approximates the best possible solution of an optimization problem. While finding the optimal solution of practical problems is often infeasible, an approximation algorithm usually produces its solution in an efficient way and provides formal guarantees about the quality of the approximation. An example of such a problem is the so-called “traveling salesman problem” which consists in finding among all possible itineraries the shortest route that allows a salesman to visit a given set of cities and come back home.
Logic in Computer Science

31.5.2018
Paul-André Melliès (IRIF) will present at LICS 2018 his work on ribbon tensorial logic, a primary logic designed to reveal the secret topology of reasoning. This is the first time that logical proofs are faithfully translated into topological tangles using functorial knot theory.
knot theory

Knot theory studies mathematical knots. These are like the usual shoelaces and rope knots but with the difference that the ends of the string are joined together so that it cannot be undone. Of particular interest is the study of when two knots are equivalent, that is when one can be transformed into the other without cutting the string or passing the string through itself. The theory has applications in physics, biology, chemistry, and computer science. For instance, the security of some quantum money relies on the assumption that given two different looking but equivalent knots, it is difficult to explicitly find a transformation that takes one to the other.
Tous femmes du numérique !

30.5.2018
« Tous femmes de numérique ! » Après leur rencontre avec 4 informaticiennes de l’IRIF, 14 lycéennes du Lycée Jules Ferry ont expliqué à leurs camarades l’exposition permanente du Palais de la découverte sur l’informatique et les sciences du numérique le 29/05.

Logic in Computer Science

25.5.2018
Marie Kerjean (PhD student IRIF) will present at LICS 2018 a logical account for linear partial differential equations. With this work, she unveils a bridge between mathematical physics and proof theory, paving the way for exciting and mutually beneficial transfers of techniques.
sequent

A sequent represents a theorem by a sequence of hypotheses and the sequence of possible theses they imply. This formalism underlines a symmetry hypotheses/theses ruled by negation and is used in sequent calculus to formalise proofs and to study their properties.
Logic in Computer Science

21.5.2018
Pierre Vial (IRIF) will present at LiCS 2018 an excerpt of his PhD work at IRIF proving that every lambda-term has an infinite linear representation in the infinitary relational model. This work pioneers a technique that allows giving a semantic even to unproductive programs.
unproductive

A part of a program is unproductive if it performs an infinite number of computing steps without any interaction with the rest of the program or external devices. Unproductive code is basically useless, and may even be unsafe, and detecting parts of code that are unproductive is important to improve software quality.
Ants

11.5.2018
Amos Korman (IRIF) Amos Korman is co-chairing, and organizing the 6th Workshop on Biological Distributed Algorithms, to be held in London in July, the 23rd.
biological algorithm

Biological algorithm is a term used to describe the biological processes from an algorithmic, or computer scientific, perspective. It concerns questions such as what are the algorithmic challenges faced by the biological organism, and what are the algorithmic principals used in order to overcome these challenges. For example, when a group of ants finds a large piece of food and needs to decide its navigation rout back to the nest, what are the benefits and pitfalls of noise in their communication?
Institue de France

4.5.2018
Miklos Santha (IRIF) participates to the conference-debate Calcul, communication, simulation et métrologie quantiques : des principes aux réalisations concrètes organized by Académie des sciences at the Institut de France on May 15.

Institut Universitaire de France

27.4.2018
IRIF is proud to announce that Delia Kesner, professor of University Paris Diderot and researcher at IRIF, was appointed senior member of IUF.

Logic in Computer Science

23.4.2018
Six papers coauthored by IRIF members will be presented at the prestigious conference LICS'18 in Oxford this summer. Topics range from λ-calculus, to Separation Logic…

Research at Google

6.4.2018
Victor Lanvin (PhD student of Giuseppe Castagna, IRIF) is awarded the Google PhD fellowship! Through the FSMP, Google will give a significant support to Victor's research work on gradual typing.
gradual typing

Gradual typing is a technique that allows the programmer to control which parts of a program check their type correctness (i.e., that apples are added to apples) before execution and which parts check it during their execution instead. It is often used to gradually add the before-execution check to dynamic languages, like JavaScript, which perform the check only at run-time, since it is generally better to find errors before the execution of a program rather than during its execution.
Numeration 2018

3.4.2018
The conference Numeration 2018 will be held on May 22-25 at the University Paris Diderot, and is organized by Valérie Berthé, Christiane Frougny and Wolfgang Steiner from IRIF.

ANR Delta

21.3.2018
The next meeting of the ANR project DELTA, conducting research about the new challenges in Logic, Automata and Transducers, will take place at University Paris Diderot from 2018/03/26 to 2018/03/28. Scientific talks are public.
automaton

An automaton is a construct made of states designed to determine if a sequence of inputs should be accepted or rejected. It starts from initial state and when it receives a new input it moves to another state according to the way it was programmed. If at the end of all inputs the automaton is in a state designated as final, then the sequence of inputs is accepted, otherwise it is rejected.
Agence Nationale pour le Recherche

21.3.2018
The next meeting of the ANR project DESCARTES, aiming at defining a modular approach for distributed computing, will take place at IRIF on March 28, 2018. Scientific talks are public.

The Kappa platform for rule-based modeling

21.3.2018
“The Kappa platform for rule-based modeling”, a collaboration between Jean Krivine (IRIF) and researchers from Harvard University, ENS and Santa Cruz University will be presented at ISMB2018.

IRIF Distinguished Talk

8.3.2018
In the scope of the IRIF Distinguished Talks Series Monika Henzinger (University of Vienna) will give on April 13 a talk on “The state of the art in dynamic graph algorithms”.
algorithm

Algorithm: an algorithm is the formal description of a procedure that is used to solve a class of problems. The description consists in a sequence (of finite length) of operations that are interpreted unambiguously by who/what is executing the algorithm. Every algorithm can be directly executed or simulated by any Turing-complete system.
STOC

2.3.2018
Adrian Kosowski (IRIF), together with Bartek Dudek (University of Wroclaw), will present at STOC 2018 a new protocol for spreading information in a population. This is the first time that methods of oscillatory dynamics are used to solve a basic task of information dissemination.
information dissemination

Information dissemination is the process by which a piece of information is propagated in a distributed system through direct communications from node to node. Rumor spreading between humans or broadcasting in a network are two typical examples. Information propagation is a basic building block of many distributed algorithms and its analysis is often critical in understanding their complexity.

27.2.2018
Constantin Enea (IRIF) is an organizer of the 2018 edition of the EPIT research school, on the subject of software verification, to he held in Aussois on May 7-11 2018.

Fondation Sciences Mathématiques de Paris

27.2.2018
FSMP offers 20 PhD student positions in Maths and TCS under H2020 COFUND project MathInParis. As a member of the FSMP network, IRIF is an eligible hosting lab. Call for application is open until April, 1st 2018. Applicants must be international students, but master students already in France for less than a year are eligible.

MOVEP

7.2.2018
Peter Habermehl (IRIF) and Benedikt Bollig (LSV, ENS Paris-Saclay) organize the research school MOVEP (Modelling and Verification of Parallel Processes), on July 16-20 in Cachan.

Université Paris 7 - Denis Diderot

5.2.2018
Université Paris Diderot has opened three permanent positions in Computer Science (1 professor on Graph and applications, 1 assistant professor on Software Science, 1 assistant professor on Data Science). Recruited researchers will join IRIF.

Palais de la Découverte

4.2.2018
Laurent Viennot (IRIF, Inria) is Scientific Curator of the exhibition Informatique et sciences du numérique, at Palais de la découverte, starting March 13, 2018.

Amina Doumane

2.2.2018
Amina Doumane, now at LIP, was awarded the “La Recherche” prize in the Computer Science category for her paper entitled Constructive Completeness for the linear-time mu-calculus, a work accomplished during her PhD at IRIF and that appeared in the proceedings of LICS’17.

Nature

1.2.2018
The first on-the-fly quantum money transaction was implemented by researchers in Paris, including Iordanis Kerenidis. ​Quantum ​money is provably unforgeable​ due to the no-cloning property of quantum information.​
quantum information

Quantum Information is the information stored in a quantum system. A quantum system is composed of one or many qubits: the fundamental unit of quantum information. A qubit is a 2-dimensional vector. The basis encodes two classical values of a bit. Quantum information, i.e. Von Neuman entropy, is the analogous of Shannon entropy for classical information, and it is often used to measure physical properties of a quantum system, like the entanglement.
Lia INFINIS

27.1.2018
The international French and Argentina CNRS laboratory called INFINIS lead by Delia Kesner (IRIF) and Sergio Yovine (CONICET) is presented in the CNRS Rio newsletter.

Maurice Nivat

18.1.2018
IRIF organizes on February, 6th a Scientific Day in memory of Maurice Nivat, professor at Paris Diderot University and a pionneer of theoretical computer science. Please register.

Agence Nationale pour le Recherche

11.1.2018
January the 10th 2018, this is the kick-off meeting of the ANR project FREDDA (FoRmal mEthods for the Design of Distributed Algorithms).

Innovations in Theoretical Computer Science

5.1.2018
Lucas Boczkowski and Amos Korman from IRIF, with their co-authors, will present at ITCS 2018 a non-conditional lower bound on information dissemination in stochastic populations. The paper is the first ever to combine an algorithmic lower bound with a biology experiment in collective behavior.

Convention Industrielle de Formation par la Recherche

19.12.2017
IRIF and ATOS have started the first Industrial PhD Thesis (CIFRE) on quantum algorithms in France. The PhD candidate Alessandro Luongo is co-advised by Iordanis Kerenidis and Frédéric Magniez.

Société Informatique de France

29.11.2017
Amina Doumane was awarded the Gilles Kahn prize for her PhD thesis entitled « On the infinitary proof theory of logics with fixed points » supervised by Alexis Saurin, David Baelde and Pierre-Louis Curien.

Société Informatique de France

29.11.2017
Wenjie Fang was awarded the Honorable Mention of the Gilles Kahn prize for his PhD thesis entitled « Aspects énumératifs et bijectifs des cartes combinatoires : généralisation, unification et application » and supervised by Guillaume Chapuy and Mireille Bousquet-Mélou.

Maurice Nivat

27.11.2017
Scientific Day in memory of Maurice Nivat, professor at Paris Diderot University and a pionneer of theoretical computer science in France and in the world, who passed away on September the 21st, 2017.

IRIF

25.11.2017
Back-to-work day of the “Automata, Structures, and Verification” pole, which gathers the research groups Automata and applications and Modelling and verification on November 25, 2017.

IRIF

22.11.2017
6th French-Israeli Workshop on Foundations of Computer Science on November 22-23, 2017 at Tel-Aviv University, Israel.

IRIF

15.11.2017
2-day workshop on December 7-8: Closing workshop of ANR project on Restricted Data Access Models and 1st IRIF-IQC Workshop on Quantum Information Processing (CNRS bilateral collaboration).

IRIF

6.11.2017
IRIF newcomers Day on November 6, 2017 at Amphi Turing

1.11.2017
Pierre Fraigniaud (IRIF) will give a seminar at Collège de France as part of the annual Chair of Claire Mathieu (IRIF associate member) on Algorithms, November 18.

IRIF

10.10.2017
Back-to-work day of the “Proofs, programs and systems” pole on October 12-13, 2017 at room 3052.

ACM-SIAM event

6.10.2017
Guillaume Lagarde and Sylvain Perifel have solved a 20-year old conjecture related to Lempel-Ziv. This will be presented at the 29th ACM-SIAM Symposium on Discrete Algorithm (SODA 2018).

SODA

1.10.2017
Two papers coauthored by IRIF members will be presented at SODA’18, the main conference in algorithm design. Topics include the resolution of a 20-year old conjecture related to Lempel-Ziv, and a new approximation algorithm for recognizing Dyck languages.

Bérénice Oger

1.9.2017
IRIF has the great pleasure to welcome a new assistant professor: Bérénice Delcroix-Oger, an expert in combinatorics and computational algebra.

1.9.2017
Claire Mathieu (IRIF associate member) holds the Chair in Informatics and Computational Sciences at College de France in association with Inria for the academic year 2017-18.

ANR project MealyM

10.7.2017
Closing workshop of ANR project MealyM on July 10-13, 2017 at Amphi Turing.

Victor Lanvin

15.6.2017
Victor Lanvin is awarded the first prize for the ACM Student Research Competition Grand Finals, undergraduate category. The prize will be presented on June the 24th at the Turing Award Cerimony in San Francisco.

European Research Council

1.3.2017
The 5-year ERC project CombiTop of Guillaume Chapuy has started on March 1st, 2017. The purpose of this project is to use the ubiquitous nature of certain combinatorial topological objects called maps in order to unveil deep connections between several areas of mathematics.

Le Monde

30.1.2017
Amos Korman has been interviewed by Le Monde for his recent results on ants with several co-autors at IRIF.

Principle of Programming Languages 2017, Paris

2.1.2017
IRIF organizes the 44th ACM Symposium on Principles of Programming Languages (POPL 2017), Jussieu, Paris, January 15-21, 2017.

(Actualités présentées selon leur date de création)