INFORMATION Presentation Contact and access IRIF Members Charter Equality Environment Directory IRIF’s mentoring program Childcare program RESEARCH Algorithms and discrete structures Algorithms and complexity Combinatorics Distributed computing Theory and algorithmics of graphs Automata, structures and verification Automata and applications Modeling and verification Proofs, programs and systems Algebra and computation Programs and Languages (PL) Proofs and programs Picube (Inria) PUBLICATIONS (hal) EVENTS IRIF events IRIF Distinguished Talks Series IRIF days Pole meetings IRIF and environment group Research seminars Algorithms and complexity Algorithms and discrete structures Automata Enumerative and analytic combinatorics Graphs and distributed computing Formath Proofs, programs and systems Verification Non-permanent members’ seminar Online seminars Graph Transformation Theory and Applications One world numeration seminar Working groups Graphs and Logic Higher categories, polygraphs and homotopy Logic, automata, algebra and games Programming Semantics Syntax Meets Semantics Topos Theory Type theory and homotopy theory Type theory and realisability Defences PhD defences Habilitation defences MEDIATION Fête de la Science Middle/High school internships Research profiles 50 Years Exhibitation Projet QuBOBS (quantum computing explained) HIGHLIGHTS Awards and Honors Software Grants International Collaborations The EPIT Research School Academics JOIN US Visitor program Research support position Faculty members Researchers Postdocs Teaching assistants PhD Studies Master Internships Middle/High school internships INTRANET