Mikaël Rabie

Orcid: 0000-0001-6782-7625

According to our database1, Mikaël Rabie authored at least 32 papers between 2011 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Distributed computing in the asynchronous LOCAL model.
Theor. Comput. Sci., 2025

2024
Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic Energy Cost.
CoRR, 2024

Canadian Traveller Problems in Temporal Graphs.
CoRR, 2024

Shared Randomness Helps with Local Distributed Problems.
CoRR, 2024

Distributed Coloring in the SLEEPING Model.
CoRR, 2024

Asynchronous Fault-Tolerant Distributed Proper Coloring of Graphs.
Proceedings of the 38th International Symposium on Distributed Computing, 2024

2023
Lower and upper bounds for deterministic convergecast with labeling schemes.
Theor. Comput. Sci., March, 2023

Improved Pyrotechnics: Closer to the Burning Number Conjecture.
Electron. J. Comb., 2023

Forbidden Patterns in Temporal Graphs Resulting from Encounters in a Corridor.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2023

When Should You Wait Before Updating? - Toward a Robustness Refinement.
Proceedings of the 2nd Symposium on Algorithmic Foundations of Dynamic Networks, 2023

Making Self-Stabilizing Algorithms for Any Locally Greedy Problem.
Proceedings of the 2nd Symposium on Algorithmic Foundations of Dynamic Networks, 2023

2022
Making Self-Stabilizing any Locally Greedy Problem.
CoRR, 2022

Short and local transformations between (Δ+1)-colorings.
CoRR, 2022

Fault Tolerant Coloring of the Asynchronous Cycle.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

Brief Announcement: Fault Tolerant Coloring of the Asynchronous Cycle.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021
Lower Bounds for Maximal Matchings and Maximal Independent Sets.
J. ACM, 2021

Improved pyrotechnics : Closer to the burning graph conjecture.
CoRR, 2021

Distributed Recoloring of Interval and Chordal Graphs.
Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

2020
Distributed reconfiguration of maximal independent sets.
J. Comput. Syst. Sci., 2020

Wireless Broadcast with Short Labels.
Proceedings of the Networked Systems - 8th International Conference, 2020

2019
Brief Announcement: Distributed Computing in the Asynchronous LOCAL Model.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

The Distributed Complexity of Locally Checkable Problems on Paths is Decidable.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

2018
Homonym Population Protocols.
Theory Comput. Syst., 2018

Distributed Recoloring.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

2017
Global Versus Local Computations: Fast Computing with Identifiers.
Proceedings of the Structural Information and Communication Complexity, 2017

2016
Global Versus Local Computations: Fast Computing with Identifiers (Short Paper).
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2016

2013
Population Protocols that Correspond to Symmetric Games.
Int. J. Unconv. Comput., 2013

Trustful Population Protocols.
Proceedings of the Distributed Computing - 27th International Symposium, 2013

2011
Asymetric Pavlovian Populations
CoRR, 2011

Checkpointing strategies for parallel jobs.
Proceedings of the Conference on High Performance Computing Networking, 2011

Rationality authority for provable rational behavior.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Computing with Pavlovian Populations.
Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011


  Loading...