Itanium Itanium
I did a survey on how (little) compilers take advantage of the various features of the Itanium processor. This is a French report.

Register allocation Register Allocation
While in Singapore, I did a survey of the current state of register allocation. This report provides a good overview of the latest state-of-the-art techniques, as well as a critical reflexion on the field.

A network Social networks
My Bachelor's degree ended with an internship at IXXI. There, I worked on how to detect communities, more specifically in the graph of web pages. The report contains a nice overview of the budding research field, as well as a good bibliography to start with.

Classwork & research

OCaml and stuff

I SPENT A FEW MONTHS in a software company writing advanced OCaml. I kinda liked the experience, and I grew quite proficient with the language. I wanted to continue working with OCaml, so I moved to the OCaml team where I did my Master's internship. Now I'm pursuing a Ph.D. in the same place.

DURING MY INTERNSHIP WITH Gallium, I wrote a prototype translator from OCaml to a core, kernel version of System F with coercions. The goal was to explore how much we could do to offer stronger guarantees concerning the compilation process of OCaml. The prototype will parse, translate, and type-check an OCaml program. Not all features are supported, but the package includes several examples. This software requires menhir, a recent OCaml, as well as ocamlbuild.

link The report (in English)
link The prototype for you to play with

Complex networks

MY RESEARCH INTERESTS have been changing over time. When I was younger, I devoted some interested to complex networks. The report on complex networks and the Internet structure was done during my bachelor degree's internship. I also developed various tools during that internship (I implemented the HITS algorithm in Python using a SVN version of SciPy because I needed some specific FORTRAN libraries), and I have generated a collection of big subgraphs of the internet, with back links (using the Google API) with a robot I coded. I put them here in GraphML format.

Some subgraphs of the internet. They were generated in June 2008. The procedure is as follows. The base set S contains the start URL. For all s in S, add (if not done already) pages pointing to s (through link: Google feature) and pages pointed by s. Keep repeating until the size explodes.

Base URLSizeFormat
http://www.embruns.net26MGraphML
http://www.blogeee.net6.4MGraphML
http://www.mozilla.org5.8MGraphML
http://www.suez.fr2.3MGraphML
http://www.ixxi.fr1.3MGraphML
http://www.ens-lyon.fr652KGraphML
http://www.veolia.fr332KGraphML

Complex networks

OTHER INTERESTS include compilation and processor architectures. Some reports are to be found on the left side of that page.