| 2026 | ICALP | Stone Duality Proofs for Colorless Distributed Computability Theorems. | Cameron Calk, Emmanuel Godard |
| 2026 | SIROCCO | Leveraging Structural Knowledge for Solving Election in Anonymous Networks with Shared Randomness. | Jrmie Chalopin, Emmanuel Godard |
| 2025 | OPODIS | A General Input-Dependent Colorless Computability Theorem and Applications to Core-Dependent Adversaries. | Yannis Coutouly, Emmanuel Godard |
| 2020 | PODC | From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems. | Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld |
| 2019 | SIROCCO | Anonymous Read/Write Memory: Leader Election and De-anonymization. | Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld |
| 2016 | OPODIS | k-Set Agreement in Communication Networks with Omission Faults. | Emmanuel Godard, Eloi Perdereau |
| 2016 | SSS | Snap-Stabilizing Tasks in Anonymous Networks. | Emmanuel Godard |
| 2014 | Algosensors | Computing the Dynamic Diameter of Non-Deterministic Dynamic Networks is Hard. | Emmanuel Godard, Dorian Mazauric |
| 2014 | SIROCCO | What Do We Need to Know to Elect in Networks with Unknown Participants? | Jrmie Chalopin, Emmanuel Godard, Antoine Naudin |
| 2013 | FCT | Expressivity of Time-Varying Graphs. | Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita |
| 2013 | SIROCCO | A Characterization of Dynamic Networks Where Consensus Is Solvable. | tienne Coulouma, Emmanuel Godard |
| 2012 | PODC | Brief announcement: waiting in dynamic networks. | Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita |
| 2011 | SIROCCO | Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults. | Emmanuel Godard, Joseph G. Peters |
| 2007 | SIROCCO | A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives. | Victor Chepoi, Tristan Fevat, Emmanuel Godard, Yann Vaxs |
| 2007 | SOFSEM | About the Termination Detection in the Asynchronous Message Passing Model. | Jrmie Chalopin, Emmanuel Godard, Yves Mtivier, Gerard Tel |
| 2006 | OPODIS | Mobile Agent Algorithms Versus Message Passing Algorithms. | Jrmie Chalopin, Emmanuel Godard, Yves Mtivier, Rodrigue Ossamy |
| 2002 | FOSSACS | A Characterization of Families of Graphs in Which Election Is Possible. | Emmanuel Godard, Yves Mtivier |
| 2002 | SIROCCO | Equivalence of Structural Knowledges in Distributed Algorithms. | Emmanuel Godard, Yves Mtivier |
| 2001 | SIROCCO | A Characterization of Classes of GraphsRecognizable by Local Computations with Initial Knowledge. | Emmanuel Godard, Yves Mtivier |