Hugo Mirault

PhD Student

Graduate Research Assistant

Augusta University, Augusta, GA, USA

I am a Ph.D. student in the School of Computer and Cyber Sciences at Augusta University in Georgia, USA, since 2024. I am also a Graduate Research Assistant in the school under the supervision of Dr. Peter Robinson.

My research focuses on distributed algorithms and fault-tolerent computing, with a particular interest in the consensus problem in synchronous systems. I work currently on complexity efficient algorithms the sleeping model. In this model, players (or nodes) can choose to be either awake (active) or asleep (inactive, and may loose any incoming messages). We try to provide time-optimal but also efficient in terms of energy consumption algorithms to solve consensus problem and its variations. I am more generally interested in the foundations of theoretical computer science, including complexity theory and the analysis of distributed protocols.

This website serves as a central hub for my research activities. You can also find a list of my publications.

Selected publications :

Time-Optimal and Energy-Efficient Deterministic Consensus

Shachar Meir, Hugo Mirault, David Peleg, and Peter Robinson

In 29th International Conference on Principles of Distributed Systems (OPODIS 2025), 2026

Abs DOI arXiv

We study fault-tolerant consensus in a variant of the synchronous message passing model, where, in each round, every node can choose to be awake or asleep. This is known as the sleeping model (Chatterjee, Gmyr, Pandurangan PODC 2020) and defines the awake complexity (also called \emphenergy complexity), which measures the maximum number of rounds that any node is awake throughout the execution. Only awake nodes can send and receive messages in a given round and all messages sent to sleeping nodes are lost. We present new deterministic consensus algorithms that tolerate up to f
Brief Announcement: Towards Energy-Efficient Distributed Agreement

Hugo Mirault and Peter Robinson

In Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2025, 2025

Abs DOI arXiv

We study fault-tolerant consensus in a variant of the synchronous message passing model, where, in each round, every node can choose to be awake or asleep. This is known as the sleeping model (Chatterjee, Gmyr, Pandurangan PODC 2020) and defines the awake complexity (also called \emphenergy complexity), which measures the maximum number of rounds that any node is awake throughout the execution. Only awake nodes can send and receive messages in a given round and all messages sent to sleeping nodes are lost. We present new deterministic consensus algorithms that tolerate up to f
Brief Announcement: Perfect Matching with Few Link Activations

Hugo Mirault, Peter Robinson, Ming Ming Tan, and Xianbin Zhu

In Structural Information and Communication Complexity - 32nd International Colloquium, SIROCCO 2025, 2025

Abs DOI arXiv

We consider the problem of computing a perfect matching problem in a synchronous distributed network, where the network topology corresponds to a complete bipartite graph. The communication between nodes is restricted to activating communication links, which means that instead of sending messages containing a number of bits, each node can only send a pulse over some of its incident links in each round. In the port numbering model, where nodes are unaware of their neighbor’s IDs, we give a randomized algorithm that terminates in O(\log n) rounds and has a pulse complexity of O(nlogn), which corresponds to the number of pulses sent over all links. We also show that randomness is crucial in the port numbering model, as any deterministic algorithm must send at least Ω(n2) messages in the standard LOCAL model, where the messages can be of unbounded size. Then, we turn our attention to the KT_1 assumption, where each node starts out knowing its neighbors’ IDs. We show that this additional knowledge enables significantly improved bounds even for deterministic algorithms. First, we give an %O(\log n)% time deterministic algorithm that sends only O(n) pulses. Finally, we apply this algorithm recursively to obtain an exponential reduction in the time complexity to O(\log^∗ n \log \log n), while slightly increasing the pulse complexity to O(n \log^∗ n). All our bounds also hold in the standard CONGEST model with single-bit messages.