Jonas Lefèvre

According to our database, Jonas Lefèvre authored at least 9 papers between 2010 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Fully Compact Routing in Low Memory Self-Healing Trees.

Armando Castañeda, Jonas Lefèvre, Amitabh Trehan

Proceedings of the ICDCN 2020: 21st International Conference on Distributed Computing and Networking, 2020

2019

The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs.

Johanne Cohen, Jonas Lefèvre, Khaled Maâmra, George Manoussakis, Laurence Pilard

Theor. Comput. Sci., 2019

Self-Stabilizing Metric Graphs.

Robert Gmyr, Jonas Lefèvre, Christian Scheideler

Theory Comput. Syst., 2019

2018

Self-healing Routing and Other Problems in Compact Memory.

Armando Castañeda, Jonas Lefèvre, Amitabh Trehan

CoRR, 2018

2016

A Self-Stabilizing Algorithm for Maximal Matching in Anonymous Networks.

Johanne Cohen, Jonas Lefèvre, Khaled Maâmra, Laurence Pilard, Devan Sohier

Parallel Process. Lett., 2016

Self-Stabilizing Maximal Matching and Anonymous Networks.

Johanne Cohen, Jonas Lefèvre, Khaled Maamra, Laurence Pilard, Devan Sohier

CoRR, 2016

2013

Trustful Population Protocols.

Olivier Bournez, Jonas Lefèvre, Mikaël Rabie

Proceedings of the Distributed Computing - 27th International Symposium, 2013

Population Protocols on Graphs: A Hierarchy.

Olivier Bournez, Jonas Lefèvre

Proceedings of the Unconventional Computation and Natural Computation, 2013

2010

The Size of One-Way Cellular Automata.

Martin Kutrib, Jonas Lefèvre, Andreas Malcher

Proceedings of the Automata 2010, 2010