Page d'accueil du CNRS Page d'accueil de l'Université Paris Diderot Page d'accueil du LIAFA
LIAFA
Laboratoire d'Informatique Algorithmique: Fondements et Applications
CNRS UMR 7089, Université Paris Diderot - Paris 7, Case 7014
75205 Paris Cedex 13 - Tél: +33(0)1.57.27.92.56 - Fax: +33(0)1.57.27.94.09
   Staff      Contact      How to get to LIAFA      Teaching      Webmail   


Version française




Page d'accueil de la Fédération de Recherche en Mathématiques de Paris Centre

Page d'accueil de la Fondation Sciences Mathématiques de Paris
Welcome to LIAFA

The LIAFA (Laboratoire d'Informatique Algorithmique: Fondements et Applications) is supported jointly by the French National Center for Scientific Research (CNRS) and by the University Paris Diderot - Paris 7.

The main research topics addressed by LIAFA are related to theoretical computer science. They are tackled by the following five research teams of LIAFA: Algorithms and complexity, Automata and applications, Combinatorics, Distributed algorithms and graphs, and Modeling and verification.

More details


News


Jean_Mairesse01/09/2014 - Nomination of Jean Mairesse as Scientific Assistant Director at INS2I
Jean Mairesse, Senior Researcher at CNRS, was nominated the 1st september 2014 Scientific Assistant Director at INS2I, where he is in charge of the "computer science" domain.

Futur en Seine15/06/2014 - The application Algopol receives the first prize for collaborative research at Futur en Seine
The 15th of June 2014, the application Algopol, implemented by Stéphane Raux, PhD student at LIAFA/Linkfluence, and conceived by Irène Bastard, PhD student in solciology at Orange Labs within the ANR project Algopol (Cams, LIAFA, Orange Labs, Linkfluence), to study Facebook usages, has received the prize "Or" for collaborative research at the festival Futur en Seine organized by Cap Digital.

Lauren Williams06/03/2014 - Lauren Williams (University of California, Berkeley) has obtained a junior chair from FSMP
Lauren Williams, which is Associate Professor of Mathematics at the University of California-Berkeley, has won a junior chair from Fondation Sciences Mathématiques de Paris and will spend the year 2014-2015 in the Combinatorics team of LIAFA.

Jean-Éric Pin06/03/2014 - Jean-Éric Pin becomes an EATCS fellow
Jean-Éric Pin which is Director of Research in the Automata and Application team of LIAFA is among the first recipient of an EATCS fellowship for his outstanding contributions to the algebraic theory of automata and languages in connection with logic, topology, and combinatorics and service to the European TCS community.

PCQC01/01/2014 - Creation of the Federation Paris Centre for Quantum Computing PCQC
The Paris Centre for Quantum Computing (PCQC) brings together computer scientists, theoretical & experimental physicists and mathematicians that work in Paris. PCQC aspires to break the ground for the establishment of new and realistic applications in quantum information processing by uniquely combining concepts from quantum computation, communication and cryptography and eventually lead the way from a Personal Computer (PC) to a Quantum Computer (QC).

UPD01/01/2014 - Creation of the Federation in Theoretical Computer Science of Paris Diderot
The TCS federation of Paris Diderot gathers together the two CNRS labs in Computer Science at the university : LIAFA and PPS. Its main objective is to promote scientific interactions between the two labs, and, more generally, to bringing the two labs closer for preparing their merging on January 1st, 2016. Website: http://www.fifp.univ-paris-diderot.fr

More news



Forthcoming

Algorithms and complexity seminar
Tuesday 30 September 2014 at 10:45, Amos Korman:
Confidence sharing: an economic strategy for
efficient information flows in animal groups [room
1007]

Automata seminar
Friday 03 October 2014
Journée de rentrée de l`équipe automates

Enumerative and analytic combinatorics seminar
Thursday 25 September 2014 at 11h30, Olya Mandelshtam:
A Determinantal Formula for Catalan Tableaux and
TASEP Probabilities

Verification seminar
Tuesday 23 September 2014 at 11:00, Yu-Fang Chen:
Verifying Recursive Programs using Intraprocedural
Analyzers
 
 ©  LIAFA 1995, Last updating: 2014, September webmestre[at]liafa.univ-paris-diderot.fr