Français Anglais
Accueil Annuaire Plan du site
Home > Groups > Research activities > Approximation algorithms
Groups
Research activities: Approximation algorithms



Groups
  Algorithms and Complexity

Joint Inria project teams


Research highlights


Contracts & grants
  ALGOQP
  QRAC

Software & patents


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

Members
  DE ROUGEMONT Michel
  MAGNIEZ Frédéric
  SANTHA Miklos
  ROSEN Adi
  MENDY Gervais
  BOROZAN Valentin
  FERNANDEZ DE LA VEGA Wenceslas
  VISHNOI Nisheeth

Ph.D. dissertations & Faculty habilitations
  Approximate Verification - Quantum Computing
  Self-Testing for Approximate and Qantum Computing


Research activities
° 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
° Distributed algorithms
° Engineering of interactive systems
° 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
° Massively distributed algorithms for complex data
° Mediated collaboration
° Multi-hop wireless networks