Остановите войну!
for scientists:
default search action
Franck Petit
- > Home > Persons > Franck Petit
Publications
- 2023
- [j43]Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, Franck Petit:
Self-stabilizing systems in spite of high dynamics. Theor. Comput. Sci. 964: 113966 (2023) - 2022
- [e6]Stéphane Devismes, Franck Petit, Karine Altisen, Giuseppe Antonio Di Luna, Antonio Fernández Anta:
Stabilization, Safety, and Security of Distributed Systems - 24th International Symposium, SSS 2022, Clermont-Ferrand, France, November 15-17, 2022, Proceedings. Lecture Notes in Computer Science 13751, Springer 2022, ISBN 978-3-031-21016-7 [contents] - 2021
- [j42]Stéphane Devismes, Anissa Lamani, Franck Petit, Pascal Raymond, Sébastien Tixeuil:
Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious Robots. Comput. J. 64(1): 132-154 (2021) - [c73]Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, Franck Petit:
Self-stabilizing Systems in Spite of High Dynamics. ICDCN 2021: 156-165 - [c72]Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, Franck Petit:
On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics. PODC 2021: 21-31 - 2020
- [c71]Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, Franck Petit:
Brief Announcement: Self-stabilizing Systems in Spite of High Dynamics. PODC 2020: 227-229 - 2019
- [b1]Karine Altisen, Stéphane Devismes, Swan Dubois, Franck Petit:
Introduction to Distributed Self-Stabilizing Algorithms. Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers 2019, ISBN 978-3-031-00885-6 - [j39]Stéphane Devismes, Anissa Lamani, Franck Petit, Sébastien Tixeuil:
Optimal torus exploration by oblivious robots. Computing 101(9): 1241-1264 (2019) - [j35]Karine Altisen, Stéphane Devismes, Anaïs Durand, Franck Petit:
Gradual stabilization. J. Parallel Distributed Comput. 123: 26-45 (2019) - 2017
- [j33]Karine Altisen, Alain Cournier, Stéphane Devismes, Anaïs Durand, Franck Petit:
Self-stabilizing leader election in polynomial steps. Inf. Comput. 254: 330-366 (2017) - 2016
- [j30]Borzoo Bonakdarpour, Stéphane Devismes, Franck Petit:
Snap-stabilizing committee coordination. J. Parallel Distributed Comput. 87: 26-42 (2016) - [j29]Alain Cournier, Ajoy Kumar Datta, Stéphane Devismes, Franck Petit, Vincent Villain:
The expressive power of snap-stabilization. Theor. Comput. Sci. 626: 40-66 (2016) - [c65]Karine Altisen, Stéphane Devismes, Anaïs Durand, Franck Petit:
Gradual Stabilization Under \tau -Dynamics. Euro-Par 2016: 588-602 - 2015
- [c62]Stéphane Devismes, Anissa Lamani, Franck Petit, Sébastien Tixeuil:
Optimal Torus Exploration by Oblivious Robots. NETYS 2015: 183-199 - 2014
- [c58]Karine Altisen, Alain Cournier, Stéphane Devismes, Anaïs Durand, Franck Petit:
Self-stabilizing Leader Election in Polynomial Steps. SSS 2014: 106-119 - 2013
- [j26]Stéphane Devismes, Franck Petit, Sébastien Tixeuil:
Optimal probabilistic ring exploration by semi-synchronous oblivious robots. Theor. Comput. Sci. 498: 10-27 (2013) - 2012
- [c52]Stéphane Devismes, Anissa Lamani, Franck Petit, Pascal Raymond, Sébastien Tixeuil:
Optimal Grid Exploration by Asynchronous Oblivious Robots. SSS 2012: 64-76 - [c49]Stéphane Devismes, Franck Petit:
On efficiency of unison. TADDS 2012: 20-25 - 2011
- [j22]Fabienne Carrier, Stéphane Devismes, Franck Petit, Yvan Rivierre:
Asymptotically Optimal Deterministic Rendezvous. Int. J. Found. Comput. Sci. 22(5): 1143-1159 (2011) - [j20]Stéphane Devismes, Franck Petit, Vincent Villain:
Autour de l'autostabilisation. 1. Techniques généralisant l'approche. Tech. Sci. Informatiques 30(7): 873-894 (2011) - [j19]Stéphane Devismes, Franck Petit, Vincent Villain:
Autour de l'autostabilisation. 2. Techniques spécialisant l'approche. Tech. Sci. Informatiques 30(7): 895-922 (2011) - [c48]Borzoo Bonakdarpour, Stéphane Devismes, Franck Petit:
Snap-Stabilizing Committee Coordination. IPDPS 2011: 231-242 - [i12]Stéphane Devismes, Anissa Lamani, Franck Petit, Pascal Raymond, Sébastien Tixeuil:
Optimal grid exploration by asynchronous oblivious robots. CoRR abs/1105.2461 (2011) - 2009
- [c41]Fabienne Carrier, Stéphane Devismes, Franck Petit, Yvan Rivierre:
Space-Optimal Deterministic Rendezvous. PDCAT 2009: 342-347 - [c39]Stéphane Devismes, Franck Petit, Sébastien Tixeuil:
Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots. SIROCCO 2009: 195-208 - [i9]Stéphane Devismes, Franck Petit, Sébastien Tixeuil:
Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots. CoRR abs/0902.1834 (2009) - 2008
- [c34]Carole Delporte-Gallet, Stéphane Devismes, Hugues Fauconnier, Franck Petit, Sam Toueg:
With Finite Memory Consensus Is Easier Than Reliable Broadcast. OPODIS 2008: 41-57 - 2006
- [j9]Alain Cournier, Stéphane Devismes, Franck Petit, Vincent Villain:
Snap-Stabilizing Depth-First Search on Arbitrary Networks. Comput. J. 49(3): 268-280 (2006) - 2004
- [c23]Alain Cournier, Stéphane Devismes, Franck Petit, Vincent Villain:
Snap-Stabilizing Depth-First Search on Arbitrary Networks. OPODIS 2004: 267-282
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint