Остановите войну!
for scientists:
default search action
Stéphane Devismes
- > Home > Persons > Stéphane Devismes
Publications
- 2023
- [j40]Ajoy K. Datta, Stéphane Devismes, Colette Johnen, Lawrence L. Larmore:
Analysis of a memory-efficient self-stabilizing BFS spanning tree construction. Theor. Comput. Sci. 955: 113804 (2023) - 2020
- [j34]Karine Altisen, Ajoy K. Datta, Stéphane Devismes, Anaïs Durand, Lawrence L. Larmore:
Election in unidirectional rings with homonyms. J. Parallel Distributed Comput. 146: 79-95 (2020) - 2019
- [j31]Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore:
A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem. Theor. Comput. Sci. 753: 35-63 (2019) - [c50]Ajoy K. Datta, Stéphane Devismes, Colette Johnen, Lawrence L. Larmore:
Brief Announcement: Analysis of a Memory-Efficient Self-stabilizing BFS Spanning Tree Construction. SSS 2019: 99-104 - [i13]Ajoy K. Datta, Stéphane Devismes, Colette Johnen, Lawrence L. Larmore:
Analysis of a Memory-Efficient Self-Stabilizing BFS Spanning Tree. CoRR abs/1907.07944 (2019) - 2017
- [j26]Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore, Vincent Villain:
Self-Stabilizing Weak Leader Election in Anonymous Trees Using Constant Memory per Edge. Parallel Process. Lett. 27(2): 1750002:1-1750002:18 (2017) - [j25]Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore:
Self-stabilizing silent disjunction in an anonymous network. Theor. Comput. Sci. 665: 51-72 (2017) - [c48]Karine Altisen, Ajoy K. Datta, Stéphane Devismes, Anaïs Durand, Lawrence L. Larmore:
Leader Election in Asymmetric Labeled Unidirectional Rings. IPDPS 2017: 182-191 - 2016
- [j19]Ajoy Kumar Datta, Stéphane Devismes, Karel Heurtefeux, Lawrence L. Larmore, Yvan Rivierre:
Competitive self-stabilizing k-clustering. Theor. Comput. Sci. 626: 110-133 (2016) - [c43]Karine Altisen, Ajoy Kumar Datta, Stéphane Devismes, Anaïs Durand, Lawrence L. Larmore:
Leader Election in Rings with Bounded Multiplicity (Short Paper). SSS 2016: 1-6 - 2015
- [j17]Fabienne Carrier, Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Yvan Rivierre:
Self-stabilizing (f, g)-alliances with safe convergence. J. Parallel Distributed Comput. 81-82: 11-23 (2015) - [c42]Fabienne Carrier, Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore:
Self-Stabilizing ℓ-Exclusion Revisited. ICDCN 2015: 3:1-3:10 - 2013
- [j15]Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes, Karel Heurtefeux, Yvan Rivierre:
Self-Stabilizing Small k-Dominating Sets. Int. J. Netw. Comput. 3(1): 116-136 (2013) - [j11]Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Yvan Rivierre:
Self-stabilizing labeling and ranking in ordered trees. Theor. Comput. Sci. 512: 49-66 (2013) - [c36]Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore:
Self-stabilizing Silent Disjunction in an Anonymous Network. ICDCN 2013: 148-160 - [c35]Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Sébastien Tixeuil:
Fast Leader (Full) Recovery Despite Dynamic Faults. ICDCN 2013: 428-433 - [c34]Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes, Sébastien Tixeuil:
Fast Leader (Full) Recovery Despite Dynamic Faults. IPDPS Workshops 2013: 716-725 - [c33]Fabienne Carrier, Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Yvan Rivierre:
Self-stabilizing (f, g)-Alliances with Safe Convergence. SSS 2013: 61-73 - 2012
- [j10]Ajoy Kumar Datta, Stéphane Devismes, Karel Heurtefeux, Lawrence L. Larmore, Yvan Rivierre:
Algorithme autostabilisant construisant un petit ensemble k-dominant. Tech. Sci. Informatiques 31(8-10): 1273-1299 (2012) - [c32]Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes, Karel Heurtefeux, Yvan Rivierre:
Competitive Self-Stabilizing k-Clustering. ICDCS 2012: 476-485 - [c30]Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore:
Brief Announcement: Self-stabilizing Silent Disjunction in an Anonymous Network. SSS 2012: 46-48 - 2011
- [j9]Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore:
Self-Stabilizing k-out-of-ℓ Exclusion in Tree Networks. Int. J. Found. Comput. Sci. 22(3): 657-677 (2011) - [c27]Stéphane Devismes, Karel Heurtefeux, Yvan Rivierre, Ajoy Kumar Datta, Lawrence L. Larmore:
Self-Stabilizing Small k-Dominating Sets. ICNC 2011: 30-39 - [c26]Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes:
Sorting on Skip Chains. ICNC 2011: 193-199 - [c25]Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes, François Kawala, Maria Potop-Butucaru:
Multi-resource Allocation with Unknown Participants. ICNC 2011: 200-206 - [c23]Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Yvan Rivierre:
Self-stabilizing Labeling and Ranking in Ordered Trees. SSS 2011: 148-162 - [c22]Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore:
Brief Announcement: Sorting on Skip Chains. SSS 2011: 443-444 - 2009
- [c13]Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore:
Self-Stabilizing k-out-of-l exclusion on tree networks. IPDPS 2009: 1-8 - [c10]Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore:
A Self-Stabilizing O(n)-Round k-Clustering Algorithm. SRDS 2009: 147-155 - 2008
- [i2]Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore:
Self-stabilizing K-out-of-L exclusion on tree network. CoRR abs/0812.1093 (2008)
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-01-15 20:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint