About
Antoine Amarilli is an Associate Professor in Computer Science at Télécom Paris, part of Institut Polytechnique de Paris. Since September 2024, he has been on leave to work as an advanced researcher in the LINKS team at Inria Lille. His research spans theoretical computer science, focusing on query evaluation, probabilistic data, knowledge compilation, and computational logic.
- Member of DIG and LINKS research teams
- Part of LTCI (Information Processing and Communication Laboratory)
Education:
- PhD in Computer Science (Télécom ParisTech, 2016)
- Habilitation (HDR) in Computer Science (Institut Polytechnique de Paris, 2023)
Research Interests: He investigates efficient query evaluation on uncertain data, dynamic data maintenance, knowledge compilation techniques, and the interplay between circuits, automata, and logical languages. His work intersects database theory, graph theory, and computational complexity.
Publications Trends: Recent articles address tractability of queries on probabilistic graphs, complexity classifications for MSO and regular path queries, and knowledge compilation frameworks for enumeration algorithms. Key subfields include probabilistic reasoning, graph constraints, and circuit-based optimizations.
Awards:
- Best Paper at ICDT 2020
- Best Paper at ICALP 2021 (Track B)
- Télécom Paris PhD Prize (2017)
- Beth Dissertation Award (2017)
Teaching & Service: He taught competitive programming, algorithms, and data management at Télécom Paris and represented the institution on the MPRI master’s committee. He co-organized Highlights of Logic, Games, and Automata (2022) and served as a program committee member for ICDT, ICALP, and AAAI.
Research Activism: Co-founded TCS4F (Theoretical Computer Scientists for Future) and No Free View? No Review! initiatives to address climate impact and open-access advocacy in academia.
