CV-Resume
Basics
Name | Hugo Mirault |
Label | PhD Student / Graduate research assistant |
hmirault@augusta.edu | |
Url | https://Hmirault.github.io/ |
Summary | PhD Student at Augusta University, GA, USA. My research focuses on fault-tolerant distributed algorithms, with a particular interest in the consensus problem and energy complexity. |
Work
-
2024 - Present Graduate research assistantship
Augusta University
Graduate Research Assistant under the supervision of Dr. Peter Robinson, focusing on distributed algorithms.
-
2023 - 2023 Formal Methods Engineer
Systerel
Formal Methods Engineer for the design and formal verification of automatic trains (CBTC), using B-Method and interactive proof.
-
2022 - 2022 End-of-study Internship - Secure Multiparty Computation
LIRMM
Studied secure multiparty computation (MPC) protocols in the context of algebraic computation on matrices. Wrote a final dissertation on the topic.
-
2021 - 2021 Research Internship - Kolmogorov Complexity
LIRMM
Studied the link between Kolmogorov prefix complexity and the Martin-Löf notion of randomness, focusing on the Chaitin constant.
Education
-
2024 - Present -
2020 - 2022 Master's Degree
University of Montpellier, France
Algorithmics (ALGO/MIT)
- Graph Theory
- Complexity Theory
- Information Theory
- Cryptography
- Formal Methods
-
2017 - 2020
Publications
-
2025 Brief Announcement: Towards Energy-Efficient Distributed Agreement
PODC 2025
Authors: Hugo Mirault and Peter Robinson.
-
2025 Brief Announcement: Perfect Matching with Few Link Activations
SIROCCO 2025 (Lecture Notes in Computer Science, vol 15671)
Authors: Mirault, H., Robinson, P., Tan, M.M., Zhu, X.
Languages
French | |
Native Speaker |
English | |
Fluent (B2/C1) |
Interests
Research Interests | |
Distributed algorithms | |
Information theory | |
Concurrency | |
Fault resilience | |
Byzantine resilience | |
Distributed protocols |
Projects
- 2021 - 2021
Student Project - Scheduler
Modeled a scheduling problem, implemented an exact Mixed-Integer Programming (MIP) solver and various heuristics, and compared their performance.
- University of Montpellier