David Saulpic

About me

I am a post-doc at the University of Vienna, where I am hosted by Monika Henzinger. I just graduated from Sorbonne Université, in Paris, where I was very glad to be have been advised by Vincent Cohen-Addad and Christoph Dürr.
I obtained a M. Sc. in Computer Science from the Parisian Master of Research in Computer Science and École Normale Supérieure (ENS Paris), where I also did my Bachelor.

I am broadly interested in algorithms, with a particular attention to Clustering problems for which I strive for a clear picture of their multiple facets: for instance, when is it possible to recover clusters, with what precision, how much data is necessary?
I am also trying to understand the success of k-Means objective function among practitioners. Is it because we love to assume we live in a Gaussian world? Or because of Lloyd's algorithm? If you have an idea on that matter, I'd love to discuss it with you!

Besides clustering, I am more generally interested in theory of problems arising from data analysis. I would like to design algorithms for those problems, with provable guarantee, for instances with constraints on the memory usage, or privacy or robustness requirements.


You can find a (hopefully up-to-date) CV here