default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlain Cournier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Karine Altisen, Alain Cournier, Geoffrey Defalque, Stéphane Devismes
:
Self-stabilizing synchronous unison in directed networks. Theor. Comput. Sci. 1001: 114577 (2024)- [c23]Karine Altisen, Alain Cournier, Geoffrey Defalque, Stéphane Devismes:
On Self-stabilizing Leader Election in Directed Networks. PODC 2024: 527-537 - 2023
- [c22]Karine Altisen, Alain Cournier, Geoffrey Defalque, Stéphane Devismes:
Self-stabilizing Synchronous Unison in Directed Networks. ICDCN 2023: 115-124
2010 – 2019
- 2019
- [j9]Alain Cournier, Stephane Rovedakis, Vincent Villain:
The first fully polynomial stabilizing algorithm for BFS tree construction. Inf. Comput. 265: 26-56 (2019) - [c21]Adrien Legrand, Harold Trannois, Alain Cournier:
Use of Uncertainty with Autoencoder Neural Networks for Anomaly Detection. AIKE 2019: 32-35 - 2017
- [j8]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
- [j7]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) - 2014
- [c20]Karine Altisen, Alain Cournier, Stéphane Devismes, Anaïs Durand, Franck Petit:
Self-stabilizing Leader Election in Polynomial Steps. SSS 2014: 106-119 - 2013
- [j6]Alain Cournier, Swan Dubois, Anissa Lamani, Franck Petit, Vincent Villain:
The snap-stabilizing message forwarding algorithm on tree topologies. Theor. Comput. Sci. 496: 89-112 (2013) - 2012
- [c19]Alain Cournier, Swan Dubois, Anissa Lamani, Franck Petit, Vincent Villain:
Snap-Stabilizing Message Forwarding Algorithm on Tree Topologies. ICDCN 2012: 46-60 - 2011
- [j5]Alain Cournier, Swan Dubois, Vincent Villain:
How to improve snap-stabilizing point-to-point communication space complexity? Theor. Comput. Sci. 412(33): 4285-4296 (2011) - [c18]Alain Cournier, Stephane Rovedakis, Vincent Villain:
The First Fully Polynomial Stabilizing Algorithm for BFS Tree Construction. OPODIS 2011: 159-174 - [i4]Alain Cournier, Swan Dubois, Anissa Lamani, Franck Petit, Vincent Villain:
Snap-Stabilizing Message Forwarding Algorithm on Tree Topologies. CoRR abs/1107.6014 (2011) - 2010
- [c17]Alain Cournier, Swan Dubois, Anissa Lamani, Franck Petit, Vincent Villain:
Snap-Stabilizing Linear Message Forwarding. SSS 2010: 546-559 - [i3]Anissa Lamani, Alain Cournier, Swan Dubois, Franck Petit, Vincent Villain:
Snap-Stabilizing Linear Message Forwarding. CoRR abs/1006.3432 (2010)
2000 – 2009
- 2009
- [j4]Alain Cournier, Stéphane Devismes, Vincent Villain:
Light enabling snap-stabilization of fundamental protocols. ACM Trans. Auton. Adapt. Syst. 4(1): 6:1-6:27 (2009) - [c16]Alain Cournier, Swan Dubois, Vincent Villain:
A snap-stabilizing point-to-point communication protocol in message-switched networks. IPDPS 2009: 1-11 - [c15]Alain Cournier:
A New Polynomial Silent Stabilizing Spanning-Tree Construction Algorithm. SIROCCO 2009: 141-153 - [c14]Alain Cournier, Swan Dubois, Vincent Villain:
How to Improve Snap-Stabilizing Point-to-Point Communication Space Complexity? SSS 2009: 195-208 - [i2]Alain Cournier, Swan Dubois, Vincent Villain:
Une CNS pour l'acheminement de messages instantanément stabilisant. CoRR abs/0905.1786 (2009) - [i1]Alain Cournier, Swan Dubois, Vincent Villain:
Two snap-stabilizing point-to-point communication protocols in message-switched networks. CoRR abs/0905.2540 (2009) - 2006
- [j3]Alain Cournier, Stéphane Devismes, Franck Petit, Vincent Villain:
Snap-Stabilizing Depth-First Search on Arbitrary Networks. Comput. J. 49(3): 268-280 (2006) - [c13]Alain Cournier, Stéphane Devismes, Vincent Villain:
Snap-Stabilizing PIF and Useless Computations. ICPADS (1) 2006: 39-48 - [c12]Alain Cournier, Stéphane Devismes, Vincent Villain:
From Self- to Snap- Stabilization. SSS 2006: 199-213 - 2005
- [j2]Alain Cournier, Ajoy Kumar Datta, Franck Petit, Vincent Villain:
Optimal snap-stabilizing PIF algorithms in un-oriented trees. J. High Speed Networks 14(2): 185-200 (2005) - [c11]Alain Cournier, Stéphane Devismes, Vincent Villain:
Snap-Stabilizing Detection of Cutsets. HiPC 2005: 488-497 - [c10]Alain Cournier, Stéphane Devismes, Vincent Villain:
A Snap-Stabilizing DFS with a Lower Space Requirement. Self-Stabilizing Systems 2005: 33-47 - 2004
- [c9]Alain Cournier, Stéphane Devismes, Franck Petit, Vincent Villain:
Snap-Stabilizing Depth-First Search on Arbitrary Networks. OPODIS 2004: 267-282 - 2003
- [c8]Alain Cournier, Ajoy Kumar Datta, Franck Petit, Vincent Villain:
Enabling Snap-Stabilizatio. ICDCS 2003: 12-19 - [c7]Lélia Blin, Alain Cournier, Vincent Villain:
An Improved Snap-Stabilizing PIF Algorithm. Self-Stabilizing Systems 2003: 199-214 - 2002
- [c6]Alain Cournier, Ajoy Kumar Datta, Franck Petit, Vincent Villain:
Snap-Stabilizing PIF Algorithm in Arbitrary Networks. ICDCS 2002: 199-206 - [c5]Alain Cournier:
Search in Indecomposable Graphs. WG 2002: 80-91 - 2001
- [c4]Alain Cournier, Franck Petit, Vincent Villain, Ajoy Kumar Datta:
Self-Stabilizing PIF Algorithm in Arbitrary Rooted Networks. ICDCS 2001: 91-98 - [c3]Alain Cournier, Ajoy Kumar Datta, Franck Petit, Vincent Villain:
Optimal Snap-Stabilizing PIF in Un-Oriented Trees. OPODIS 2001: 71-90
1990 – 1999
- 1998
- [j1]Alain Cournier, Pierre Ille:
Minimal indecomposable graphs. Discret. Math. 183(1-3): 61-80 (1998) - 1994
- [c2]Alain Cournier, Michel Habib:
A New Linear Algorithm for Modular Decomposition. CAAP 1994: 68-84 - 1992
- [c1]Alain Cournier, Michel Habib:
An Efficient Algorithm to Recognize Prime Undirected Graphs. WG 1992: 212-224
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-06-19 21:00 CEST 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:
