Rate My Professor Emmanuel Godard

Godard earned his PhD in 'Reécritures et Algorithmique Distribuée' from the University of Bordeaux in 2002, supervised by Yves Métivier, following a Master's degree from Aix-Marseille University (1994–1998) and studies in mathematics and computer science at École Normale Supérieure de Cachan. His career includes Full Professor at Aix-Marseille University since September 2015, Associate Professor there from 2010, post-doctoral ATER position at Aix-Marseille University (2002–2003), CNRS PIMS position at Simon Fraser University (2009/2010), and sabbatical at University of Victoria (2009/2010). He previously served as R&D Engineer in cryptography at FinGO (2000). His research centers on distributed algorithms, network modeling, computability and complexity, lower bounds, topological methods for distributed systems, and graph combinatorics. Key publications include 'Back to the Coordinated Attack Problem' (Mathematical Structures in Computer Science, 2020, with Eloi Perdereau), 'From Bezout’s Identity to Space-Optimal Election in Anonymous Memory Systems' (PODC 2020, with Damien Imbs, Michel Raynal, Gadi Taubenfeld), 'Leader-based de-anonymization of an anonymous read/write memory' (Theoretical Computer Science, 2020), 'Snap-Stabilizing Tasks in Anonymous Networks' (Theory of Computing Systems, 2019), and contributions to DISC, OPODIS, and SIROCCO. He reviews for journals like Theoretical Computer Science and conferences including PODC and DISC.