default search action
Anaïs Durand
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Lélia Blin, Anaïs Durand, Sébastien Tixeuil:
Resource efficient stabilization for local tasks despite unknown capacity links. Theor. Comput. Sci. 1013: 114744 (2024) - [c18]Anaïs Durand, Michel Raynal, Gadi Taubenfeld:
Better Sooner Rather Than Later. SIROCCO 2024: 226-237 - [c17]Quentin Bramas, Stéphane Devismes, Anaïs Durand, Pascal Lafourcade, Anissa Lamani:
Optimal Asynchronous Perpetual Grid Exploration. SSS 2024: 89-105 - 2023
- [j8]Karine Altisen, Stéphane Devismes
, Anaïs Durand
Self-stabilizing systems in spite of high dynamics. Theor. Comput. Sci. 964: 113966 (2023) - [j7]Anaïs Durand, Michel Raynal
Reaching agreement in the presence of contention-related crash failures. Theor. Comput. Sci. 966-967: 113982 (2023) - [j6]Omar Darwich, Ahmet-Sefa Ulucan, Quentin Bramas
Perpetual torus exploration by myopic luminous robots. Theor. Comput. Sci. 976: 114143 (2023) - [c16]Anaïs Durand, Nancy El Rachkidy, Alexandre Guitton:
MADERE: Mobile Adaptive Datarate for LoRaWAN. WCNC 2023: 1-6 - [i3]Anaïs Durand, Michel Raynal, Gadi Taubenfeld:
Better Sooner Rather Than Later. CoRR abs/2309.11350 (2023) - 2022
- [j5]Anaïs Durand
Contention-related crash failures: Definitions, agreement algorithms, and impossibility results. Theor. Comput. Sci. 909: 76-86 (2022) - [c15]Quentin Bramas, Stéphane Devismes, Anaïs Durand
Beedroids: How Luminous Autonomous Swarms of UAVs Can Save the World? FUN 2022: 7:1-7:21 - [c14]Omar Darwich, Ahmet-Sefa Ulucan, Quentin Bramas, Anissa Lamani, Anaïs Durand, Pascal Lafourcade:
Perpetual Torus Exploration by Myopic Luminous Robots. SSS 2022: 164-177 - [c13]Anaïs Durand, Michel Raynal, Gadi Taubenfeld:
Reaching Consensus in the Presence of Contention-Related Crash Failures. SSS 2022: 193-205 - [d3]Omar Darwich, Ahmet-Sefa Ulucan, Quentin Bramas
Perpetual Torus Exploration by Myopic Luminous Robots: The Animations. Zenodo, 2022 - [d2]Omar Darwich, Ahmet-Sefa Ulucan, Quentin Bramas
Perpetual Torus Exploration by Myopic Luminous Robots: The Animations. Zenodo, 2022 - [d1]Omar Darwich, Ahmet-Sefa Ulucan, Quentin Bramas
Perpetual Torus Exploration by Myopic Luminous Robots: The Animations. Zenodo, 2022 - 2021
- [c12]Karine Altisen, Stéphane Devismes
Self-stabilizing Systems in Spite of High Dynamics. ICDCN 2021: 156-165 - [c11]Karine Altisen, Stéphane Devismes, Anaïs Durand
On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics. PODC 2021: 21-31 - 2020
- [j4]Karine Altisen, Ajoy K. Datta, Stéphane Devismes, Anaïs Durand
Election in unidirectional rings with homonyms. J. Parallel Distributed Comput. 146: 79-95 (2020) - [c10]Karine Altisen, Stéphane Devismes
Brief Announcement: Self-stabilizing Systems in Spite of High Dynamics. PODC 2020: 227-229 - [i2]Lélia Blin, Anaïs Durand, Sébastien Tixeuil:
Ressource Efficient Stabilization for Local Tasks despite Unknown Capacity Links. CoRR abs/2002.05382 (2020)
2010 – 2019
- 2019
- [j3]Karine Altisen, Stéphane Devismes
Gradual stabilization. J. Parallel Distributed Comput. 123: 26-45 (2019) - [c9]Anaïs Durand
Reducing the Number of Messages in Self-stabilizing Protocols. SSS 2019: 133-148 - 2018
- [c8]Anaïs Durand
Message-Efficient Self-stabilizing Transformer Using Snap-Stabilizing Quiescence Detection. SIROCCO 2018: 20-24 - [c7]Karine Altisen, Stéphane Devismes
Acyclic Strategy for Silent Self-stabilization in Spanning Forests. SSS 2018: 186-202 - [c6]Anaïs Durand
Set Agreement and Renaming in the Presence of Contention-Related Crash Failures. SSS 2018: 269-283 - [i1]Karine Altisen, Stéphane Devismes, Anaïs Durand:
Acyclic Strategy for Silent Self-Stabilization in Spanning Forests. CoRR abs/1805.02401 (2018) - 2017
- [b1]Anaïs Durand:
Efficient Distributed Algorithms Suited for Uncertain Contexts. (Algorithmes distribués efficaces adaptés à un contexte incertain). Grenoble Alpes University, France, 2017 - [j2]Karine Altisen, Alain Cournier, Stéphane Devismes
Self-stabilizing leader election in polynomial steps. Inf. Comput. 254: 330-366 (2017) - [j1]Karine Altisen, Stéphane Devismes
Concurrency in snap-stabilizing local resource allocation. J. Parallel Distributed Comput. 102: 42-56 (2017) - [c5]Karine Altisen, Ajoy K. Datta, Stéphane Devismes
Leader Election in Asymmetric Labeled Unidirectional Rings. IPDPS 2017: 182-191 - 2016
- [c4]Karine Altisen, Stéphane Devismes
Gradual Stabilization Under \tau -Dynamics. Euro-Par 2016: 588-602 - [c3]Karine Altisen, Ajoy Kumar Datta, Stéphane Devismes
Leader Election in Rings with Bounded Multiplicity (Short Paper). SSS 2016: 1-6 - 2015
- [c2]Karine Altisen, Stéphane Devismes
Concurrency in Snap-Stabilizing Local Resource Allocation. NETYS 2015: 77-93 - 2014
- [c1]Karine Altisen, Alain Cournier, Stéphane Devismes
Self-stabilizing Leader Election in Polynomial Steps. SSS 2014: 106-119
Coauthor Index
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-11-05 22:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: