1. My ANR project DIDYA, studying distributed dynamic graph algorithms, was selected for funding! 2. Our paper 'Lower Bounds for k-Set Agreement in Fault-Prone Networks' will appear in DISC'25 conference. 3. Our paper 'Solvability Characterization for General Three-Process Tasks' appeared in PODC'25. 4. Published multiple papers in conferences such as SIROCCO'25, STACS'25, SOSA'25, etc.
Research Experience
Research scientist (chargé de recherche) at LISN lab - CNRS and Paris-Saclay University. Leader of the ANR project DIDYA, focused on distributed dynamic graph algorithms.
Background
Computer scientist interested in distributed graph algorithms, topological methods in distributed computing, dynamic graph algorithms, and the theory of computing in general.
Miscellany
The cover photo was taken by me at Méert, Lille. My photo was taken by Thaler Tamás.