Jonas Lefèvre

Publications

[1] Olivier Bournez and Jonas Lefèvre. Population protocols on graphs: A hierarchy. In UCNC, pages 31--42, 2013. [ bib ]
[2] Olivier Bournez and Jonas Lefèvre. Population protocols on graphs: A hierarchy. In Proceedings of the Spatial Computing Workshop (SCW 2013) colocated with AAMAS (W09), pages 17--22, 2013. [ bib ]
[3] Olivier Bournez, Jonas Lefèvre, and Mikaël Rabie. Trustful population protocols. In DISC, pages 447--461, 2013. [ bib ]
[4] Martin Kutrib, Jonas Lefèvre, and Andreas Malcher. The size of one-way cellular automata. In Automata, pages 71--90, 2010. [ bib ]
[5] Robert Gmyr, Jonas Lefèvre, and Christian Scheideler. Self-stabilizing metric graphs. In International Symposium on Stabilization, Safety, and Security of Distributed Systems, pages 248--262. Springer, 2016. [ bib ]
[6] Johanne Cohen, Jonas Lefèvre, Khaled Maâmra, Laurence Pilard, and Devan Sohier. Self-stabilizing maximal matching and anonymous networks. arXiv preprint arXiv:1611.05616, 2016. [ bib ]
[7] Johanne Cohen, Jonas Lefèvre, Khaled Maamra, George Manoussakis, and Laurence Pilard. The mann et al. self-stabilizing 2/3-approximation matching algorithm is sub-exponential. CoRR, abs/1604.08066, 2016. [ bib | http ]
[8] Robert Gmyr, Jonas Lefèvre, and Christian Scheideler. Self-stabilizing metric graphs. Theory of Computing Systems, Nov 2017. [ bib | DOI | http ]
[9] A. Castañeda, J. Lefèvre, and A. Trehan. Self-healing Routing and Other Problems in Compact Memory. ArXiv e-prints, March 2018. [ bib | arXiv ]
Keywords: Computer Science - Distributed, Parallel, and Cluster Computing, E.1, H.3.4, C.2.1, C.2.4, G.2.2

This file was generated by bibtex2html 1.98.