Clément Legrand Duchesne

École Normale Supérieure de Rennes clement.legrand-duchesne@ens-rennes.fr

I am curently studying computer science at ENS-Rennes.

I'm mainly interested in algorithmic, complexity theory, graph theory and math (especially algebra and discrete mathematics).

Academic Background

Master Degree in computer science

Mathematic courses
  • Signal Processing
Computer science courses
  • Semantics
  • Compilers
  • Complexity Theory
  • Solvers
  • Linux Operating System
  • Formal Methods
  • Bioinformatics
September 2018 - Present

Bachelor of computer science

Mathematic courses
  • Lebesgue integration
  • Probability and statistics
  • Convex optimisation
  • Algebra
Computer science courses
  • System and process architecture
  • Security
  • Algorithmic and computational complexity theory (2 semesters)
  • Computer programming (2 semesters)
  • Formal langage and computability
  • Logic
  • Search engine indexing
  • Cryptography
Bachelor GPA:14.2/20
September 2017 - June 2018

CPGE MPSI-MP*

Two years of hard work in mathematic, physics and computer science in order to join the ENS.
September 2015 - June 2017

Scientific High School

In tenth grade: ISN option (very basic computer skills, programming in Python).
In senior year: mathematic option.

Baccalauréat GPA: 18.02/20

September 2012 - June 2015

Internships

Potential NP-completeness of a tree compression problem

Two months in the MOSAIC team in the ENS de Lyon. During this internship I tried to prove that a tree compression problem was NP-complete.
A tree is said to be self-nested if all his subtrees of equal height are isomorphic. It has been shown that self-nested trees are a natural and relevant model for the structure of a plant. The NST problem consists in approximating trees by self-nested trees. More precisely, given a tree T, the goal is to find the self-nested tree S that minimizes the edit distance between S and T. In the report I wrote at the end of the internship, we present our attempts to prove that this problem is NP-complete, as well as polynomial algorithms when T is of height 2.
Grade: 19/20
June 2018 - July 2018

Projects and personal experience

TIPE: Randomized and Approximation Algorithms for the Max Cut Problem

My interest in algorithms and graph theory led me to implement approximation algorithms for the Max-Cut Problem, and evaluate their theorical and empirical efficiency. Here is the TIPE report for the ENS competitiv exam.
January 2016 - May 2017

TPE: Mechanics of skateboard tricks

I was only in eleventh grade, but here is the TPE report for the Baccalauréat anyway. I was then a longboard enthusiast so I had a great time working on this topic.
September 2013 - May 2014

Three months in Forchheim, Bavaria (Germany)

I spent the beginning of ninth grade in Germany, doing a language exchange.
September 2011 - December 2011

A year in San Diego, California (USA)

I spent my second grade in an american elementary school.
September 2004 - July 2005

Skills

Programming Languages
  • OCaml
  • Haskell
  • Python
  • C/C++
  • Lisp
  • R
  • Coq (still working on it!)
  • Java (still working on it!)
Human Languages

I speak English, French (and German but not fluently).

Social interactions

I am a trained cup and ball gamer.

Interests

When I'm not working, I enjoy doing sports. I practise block climbing and cross-country unicycle several times a week. I am also a rugbyman and a gymnast.

I am also a big ski and snowboard enthusiast, and love surfing or going for a ride on my longboard in summer.

When the weather isn't good enough for those activities, I like to read (mainly Sci-fi and Heroic Fantasy), to listen to music or to play classic guitar. I am also a big fan of cooking.