default search action
Emmanuel Godard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c24]Yannis Coutouly, Emmanuel Godard:
A Simple Computability Theorem for Colorless Tasks in Submodels of the Iterated Immediate Snapshot. DISC 2024: 16:1-16:22 - 2023
- [c23]Yannis Coutouly, Emmanuel Godard:
A Topology by Geometrization for Sub-Iterated Immediate Snapshot Message Adversaries and Applications to Set-Agreement. DISC 2023: 15:1-15:20 - [i9]Yannis Coutouly, Emmanuel Godard:
A Topology by Geometrization for Sub-Iterated Immediate Snapshot Message Adversaries and Applications to Set-Agreement. CoRR abs/2304.05486 (2023) - 2022
- [i8]Emmanuel Godard:
Snap-Stabilizing Tasks in Anonymous Networks. CoRR abs/2203.06012 (2022) - 2021
- [i7]Emmanuel Godard, Eloi Perdereau:
Back to the Coordinated Attack Problem. CoRR abs/2103.10816 (2021) - 2020
- [j12]Emmanuel Godard
, Eloi Perdereau:
Back to the Coordinated Attack Problem. Math. Struct. Comput. Sci. 30(10): 1089-1113 (2020) - [j11]Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld:
Leader-based de-anonymization of an anonymous read/write memory. Theor. Comput. Sci. 836: 110-123 (2020) - [c22]Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld:
From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems. PODC 2020: 41-50
2010 – 2019
- 2019
- [j10]Emmanuel Godard
Snap-Stabilizing Tasks in Anonymous Networks. Theory Comput. Syst. 63(2): 326-343 (2019) - [c21]Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld:
Mutex-Based De-anonymization of an Anonymous Read/Write Memory. NETYS 2019: 311-326 - [c20]Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld:
Anonymous Read/Write Memory: Leader Election and De-anonymization. SIROCCO 2019: 246-261 - [i6]Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld:
Mutex-based Desanonymization of an Anonymous Read/Write Memory. CoRR abs/1903.12204 (2019) - 2016
- [c19]Emmanuel Godard, Eloi Perdereau:
k-Set Agreement in Communication Networks with Omission Faults. OPODIS 2016: 8:1-8:17 - [c18]Emmanuel Godard:
Snap-Stabilizing Tasks in Anonymous Networks. SSS 2016: 170-184 - [i5]Jérémie Chalopin, Emmanuel Godard, Antoine Naudin:
Using Binoculars for Fast Exploration and Map Construction in Chordal Graphs and Extensions. CoRR abs/1604.05915 (2016) - 2015
- [j9]Étienne Coulouma, Emmanuel Godard, Joseph G. Peters:
A characterization of oblivious message adversaries for which Consensus is solvable. Theor. Comput. Sci. 584: 80-90 (2015) - [j8]Arnaud Casteigts
On the expressivity of time-varying graphs. Theor. Comput. Sci. 590: 27-37 (2015) - [c17]Jérémie Chalopin, Emmanuel Godard, Antoine Naudin:
Anonymous Graph Exploration with Binoculars. DISC 2015: 107-122 - [i4]Jérémie Chalopin, Emmanuel Godard, Antoine Naudin:
Anonymous Graph Exploration with Binoculars. CoRR abs/1505.00599 (2015) - 2014
- [c16]Emmanuel Godard, Dorian Mazauric:
Computing the Dynamic Diameter of Non-Deterministic Dynamic Networks is Hard. ALGOSENSORS 2014: 88-102 - [c15]Jérémie Chalopin, Emmanuel Godard, Antoine Naudin:
What Do We Need to Know to Elect in Networks with Unknown Participants? SIROCCO 2014: 279-294 - 2013
- [c14]Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita:
Expressivity of Time-Varying Graphs. FCT 2013: 95-106 - [c13]Étienne Coulouma, Emmanuel Godard:
A Characterization of Dynamic Networks Where Consensus Is Solvable. SIROCCO 2013: 24-35 - 2012
- [j7]Victor Chepoi
A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives. Algorithmica 62(1-2): 146-168 (2012) - [j6]Jérémie Chalopin, Emmanuel Godard, Yves Métivier:
Election in partially anonymous networks with arbitrary knowledge in message passing systems. Distributed Comput. 25(4): 297-311 (2012) - [c12]Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita:
Brief announcement: waiting in dynamic networks. PODC 2012: 99-100 - [i3]Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita:
Expressivity of Time-Varying Graphs and the Power of Waiting in Dynamic Networks. CoRR abs/1205.1975 (2012) - 2011
- [c11]Tristan Fevat, Emmanuel Godard:
Minimal Obstructions for the Coordinated Attack Problem and Beyond. IPDPS 2011: 1001-1011 - [c10]Emmanuel Godard, Joseph G. Peters:
Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults. SIROCCO 2011: 29-41 - [i2]Emmanuel Godard, Joseph G. Peters:
Consensus vs Broadcast in Communication Networks with Arbitrary Mobile Omission Faults. CoRR abs/1106.3579 (2011) - 2010
- [i1]Emmanuel Godard, Yves Métivier, Gerard Tel:
Termination Detection of Local Computations. CoRR abs/1001.2785 (2010)
2000 – 2009
- 2008
- [c9]Jérémie Chalopin, Emmanuel Godard, Yves Métivier:
Local Terminations and Distributed Computability in Anonymous Networks. DISC 2008: 47-62 - 2007
- [c8]Victor Chepoi, Tristan Fevat, Emmanuel Godard, Yann Vaxès:
A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives. SIROCCO 2007: 81-95 - [c7]Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Gerard Tel:
About the Termination Detection in the Asynchronous Message Passing Model. SOFSEM (1) 2007: 200-211 - 2006
- [c6]Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Rodrigue Ossamy:
Mobile Agent Algorithms Versus Message Passing Algorithms. OPODIS 2006: 187-201 - 2004
- [j5]Emmanuel Godard, Yves Métivier, Anca Muscholl:
Characterizations of Classes of Graphs Recognizable by Local Computations. Theory Comput. Syst. 37(2): 249-293 (2004) - 2003
- [j4]Guillaume Fertin
Acyclic and k-distance coloring of the grid. Inf. Process. Lett. 87(1): 51-58 (2003) - [j3]Emmanuel Godard, Yves Métivier:
Deducible and Equivalent Structural Knowledges in Distributed Algorithms. Theory Comput. Syst. 36(6): 631-654 (2003) - 2002
- [j2]Emmanuel Godard:
A self-stabilizing enumeration algorithm. Inf. Process. Lett. 82(6): 299-305 (2002) - [j1]Guillaume Fertin
Minimum feedback vertex set and acyclic coloring. Inf. Process. Lett. 84(3): 131-139 (2002) - [c5]Emmanuel Godard, Yves Métivier:
A Characterization of Families of Graphs in Which Election Is Possible. FoSSaCS 2002: 159-172 - [c4]Emmanuel Godard, Yves Métivier, Mohamed Mosbah
Termination Detection of Distributed Algorithms by Graph Relabelling Systems. ICGT 2002: 106-119 - [c3]Emmanuel Godard, Yves Métivier:
Equivalence of Structural Knowledges in Distributed Algorithms. SIROCCO 2002: 149-164 - 2001
- [c2]Emmanuel Godard, Yves Métivier:
A Characterization of Classes of GraphsRecognizable by Local Computations with Initial Knowledge. SIROCCO 2001: 179-194
1990 – 1999
- 1998
- [c1]Emmanuel Godard, Yves Métivier, Anca Muscholl:
The Power of Local Computations in Graphs with Initial Knowledge. TAGT 1998: 71-84
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-10-25 20:13 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: