The activities of LIAFA are organized into five main areas: algorithms and complexity, automata and applications, Combinatorics, distributed algorithms and graphs and modeling and verification.

• Algorithms and complexity team works on the theory of efficient algorithms which is the common ground of research areas, in both classical computing and quantum computing.


• Automata and applications team covers the fundamental aspects of automata theory, as well as algorithmic questions arising from concrete problems.


• Combinatorics team focuses on enumerative combinatorics, bijective combinatorics and analytic combinatorics.


• Distributed algorithms and graphs team mainly covers the research topics of distributed computing and graph algorithms.


• Modeling and verification team address the development of algorithmic approaches to system verification, from theoretical foundations to innovative verification tools.