I am currently a student at the Ecole Normale Supérieure in Paris, France, studying mathematics and computer science. As of September 2011, I am starting a PhD in algorithmic topology under the supervision of Eric Colin de Verdière .
On this page you can find my CV, and some works I did at the ENS. You can contact me by sending an email to arnaud(dot)de(dot)mesmay@ens(dot)fr
with James R. Lee and Mohammad Moharrami, accepted at SODA 2012.
Masters Thesis, under the supervision of Eric Colin de Verdière
Internship report I wrote during my internship in Seattle, at the University of Washington under the supervision of James R. Lee.
These works have been presented at the Algorithmic Complexity Reading Group held at the ENS. They deal respectively about the Unique Games Conjecture, Prasad Raghavendra's work about approximating Constraint Satisfaction Problems and metric embeddings.
This work has been presented at the Summer School on Analysis and Geometry in the Theory of Computation
It deals about the basic geometry of the Heisenberg group, and how differentiation, with Pansu's Theorem, is used to prove non-embeddability results.
This work is the socalled 'Exposé de Magistère' needed to obtain a Bachelor of Science at the ENS. It is a joint work with Michaël Monerau under the supervision of Pierre Pansu and Eric Colin de Verdière.
It deals with some classical problems on graphs (Sparsest Cut and Multicommodity flow), which are known to be NP-complete. The goal is to approximate optimal solutions with a polynomial algorithm.
To accomplish that goal, we study some recent papers of Linial, London and Rabinovich where the main idea is to embed graphs into some
space.
PDF of the report,Program, requires Windows and uses OpenGL