I am a third-year Ph.D. student at IRIF, Universite Paris Cite, working with Pierre Fraigniaud and Mikael Rabie. Before, I got my Master from the Parisian master program of research in computer science MPRI, and my Bachelor in Mathematics from Hanoi National University of Education. This is my CV.

Research Interest

My research interest is in the field of distributed computing and networks. My research focuses on dynamic graphs, and agreement tasks in synchronous message-passing models. Agreement tasks, which are fundamental in the domain of distributed computing, are studied in almost all models from the synchronous message-passing model to the asynchronous shared memory model. Specifically, I study consensus and $k$-set agreement problems in the synchronous networks with the presence of crash failures, using tools from combinatorial topology. Another area of my research is dynamic networks (temporal graphs), that are networks changing over time. Specifically, my research is in topics of forbidden patterns and the online routing problem called Canadian Traveler Problem.

Publications

1. Canadian Traveler Problems in temporal graphs, WG2025. Arxiv
2. Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structure, STACS2025. Arxiv
3. A Simple Lower Bound for Set Agreement in Dynamic Networks, SOSA2025. Arxiv
4. Forbidden Patterns in temporal graphs resulting from encounters in a corridor, SSS2023. Arxiv