Groups
  Algorithms and Complexity

Joint Inria project teams


Research highlights
  Query Containment in Description Logics Reconsidered
  On the Complexity of Consistent Query Answering in the Presence of Simple Ontologies

Contracts & grants
  ALGOQP
  GT CMF
  QCCC
  QRAC

Software & patents


Collaborations
  Équipe de Logique Mathématique Université Paris Diderot Paris 7

Members
  DE ROUGEMONT Michel
  LAPLANTE Sophie
  MAGNIEZ Frédéric
  TIXEUIL Sébastien
  SANTHA Miklos
  KERENIDIS Iordanis
  KAPLAN Marc
  THEVENIN Annelyse
  DEVISMES Stéphane
  CHAILLOUX André
  MAGNIN Loïck
  VISHNOI Nisheeth
  XIAO David
  VALICOV Petru

Ph.D. dissertations & Faculty habilitations
  Efficient Self-stabilization
  Toward self-stabilizing large-scale systems
  Algorithmic Aspects of Genome Rearrangements: Duplications and Partial Orders

° Algorithm control and hyper-parameter tuning
° Algorithms for networked systems
° Automated Proof, SMT and Applications
° Automated Reasoning
° Combinatorics
° Compilation and code optimization
° Data-Centric Languages and Systems
° Deductive Verification of Programs
° Digital Fabrication
° Distributed algorithms
° Distributed Design
° Engineering of interactive systems
° Fab lab
° Formal Model-Based Testing
° Formalisation and Proof of Numerical Programs
° Formalisation of (Specification and Programming) Languages in Proof Assistants
° Generative design methods
° Graph Theory
° Green networks
° Heterogeneous Wireless Networks
° High-performance computing
° Human-Computer Interaction
° Integration of Data and Knowledge
° Interaction and visualization paradigms
° Large scale modelling