 |
|
Research topics
- Peer-to-Peer Systems.
- Game Theory (Stable Marriages, Voting Systems).
- Large Networks Modeling and Performance Analysis.
- ResearchOverflow: Rebuilding Research
Biography
I was a student at the École Normale Supérieure, rue d’Ulm from 1998 to 2002. I completed a Ph.D in Computer Science in 2004. My dissertation titled Web Graphs and PageRank-like measurements was supervised by Prof. Michel Habib and permanent INRIA researcher Laurent Viennot. From 2005 to 2010, I was a researcher in the Traffic and Resource Allocation group at Orange Labs, aka France Telecom R&D, aka CNET, part of the Transport & Packet Networks lab. In 2009, I passed the Habilitation à Diriger des Recherches (official agreement for supervising PhD students) on the topic of P2P and acyclic preference-based systems. Since 2010, I work at LINCS, a joint lab between academics and industrials, first as INRIA in the GANG research team (2010-2013), currently in the MathDyn team of NOKIA Bell Labs.
Teaching Material
Hands-on: Jupyter Notebook
After almost two months of interaction with Jupyter Notebooks in 2016, I wrote a few things that may be helpful for Lincs People. I put them in a GitHub project.
You can watch the demonstration video (French accent inside)
INF674 – Propagation in Graphs – M2 program in “Advanced Communications Networks” (M2-ACN).
Files are now hosted on GitHub.
- 2016-2017 Season (in collaboration with Céline Comte). Note that in previous seasons, the course was named Random Graphs and Epidemic Algorithms.
- 2015-2016 Season (in collaboration with Nidhi Hegde).
- 2014-2015 Season (in collaboration with Laurent Massoulié).
P2P Applications – M2 program in “Softwares and Networks”, Marne-la-Vallée University
Files are now hosted on GitHub.