Research internships in Computer Science
for master student and students of Ecole Polytechnique (promotion X2013)

Presentation of internships: 8 Septembre 2015.

Responsible

Contact: Olivier Bournez

Presentation

The computer science option INF591 extends over a large domain covering from theoretical questions to industrial applications, but always with a strong scientific or technological composant.

The proposed internships, are the result of a wide call for proposal to best research centers at the international level, both in academic and industrial research centers. They help to realize that the most innovating developpments, in particular in the industrial world, are based on a solid corpus of theoretical knowledge, and not on the routine use of commercial tools. They also prove the complexity, never reached in the past, of today's computer systems.

Students decided to do a career in research will find a wat to confirm their vocation for a particular domain, and to discover the life of research laboratories. Other students will become more familiar with the world of research and innovation, that all of them will meet in their future career. This will also be the opportunity to choose later on to do a PhD, the reference diploma at the international level.

It is highly recommended that you followed several courses in the computer science department to do an internship managed by the computer science department.

The catalog of internship proposals received for year 2015-16 :

Other suggestions:

Internship reports of past years:

Can be found here (Go to "Rapports" on left)
A list extracted of the list of internships of previous years can be found below.

Teachers & Expertises

All the teachers of the department, each in her or his own speciality, can help students in their choice and orient them to best teams.

Non-exhaustive list:

- Marie Albenque (combinatorics, algorithmics)
- Kégl Balàzs (data)
- Karhikeyan Bhargavan (proof, cryptography)
- Olivier Bournez (algorithmics, complexity) -
bournez[at]lix.polytechnique.fr
- Julie Bernauer (bioinformatics) - bernauer[at]lix.polytechnique.fr
- Luca Castelli-Aleardi (algorithmics, geometry, graphs) - amturing[at]lix.polytechnique.fr
- Julien Cervelle (algorithmics, computational models, complexity) - julien.cervelle[at]polytechnique.edu
- Philippe Chassignet (bioinformatics, computer graphics) -
chassign[at]lix.polytechnique.fr
- Kaustuv Chaudhuri (proof) -
- Thomas Clausen (networks) - Thomas.Clausen@polytechnique.edu
- Albert Cohen (compilation, architecture) - Albert.Cohen[at]inria.fr
- Alain Couvreur (cryptology, codes)
- Claudia D'Ambrosio (operational research)
- Benjamin Doerr (algorithmics, randomized algorithmics, evolutionary
algorithmics, epidemic algorithms) -
doerr[at]lix.polytechnique.fr
- Jean-Christophe Filliâtre (formal methods, programming, languages) - Jean-Christophe.Filliatre[at]lri.fr
- Eric Fusy (combinatorics)
- Eric Goubault (distributed algorithmics) - eric.goubault[at]cea.fr
- Emmanuel Haucourt (proof)
- Philippe Jacquet (networks) - jacquet[at]lix.polytechnique.fr
- Renaud Keriven (vision, computer graphics) - keriven[at]imagine.enpc.fr
- Daniel Krob (algorithmics, automata theory, complex systems) dk[at]lix.polytechnique.fr
- Stéphane Lengrand (proof, formal methods, verification stephane.lengrand[at]lix.polytechnique.fr
- Léo Liberti (optimization, operational research) - liberti[at]lix.polytechnique.fr
- Frédéric Magniez (algorithmics, complexity, quantum computing) -
magniez[at]lri.fr
- Samuel Mimram (logic, proof)
- David Monniaux (proof, verification, logic) - David.Monniaux[at]imag.fr
- Francois Morain (cryptology, security, arithmetic) -
morain[at]lix.polytechnique.fr
- Frank Nielsen (computer graphics, data)
- Steve Oudot (computer graphics, data)
- Maks Ovsjanikov (computer graphics) - Maks[at]lix.polytechnique.fr
- Vincent Pilaud (combinatorics, geometry)
- François Pottier (languages based on objects, security) -
francois.pottier[at]inria.fr
- Sylvie Putot (proof, verification)
- Antoine Rauzy (verification, logic, proof, complex systems) antoine.rauzy[at]lix.polytechnique.fr
- Stéphane Redon (computer graphics)
- Xavier Rival (proofs)
- Dario Rossi (networks) 
dario.rossi[at]telecom-paristech.fr
- Dominique Rossin (algorithmics, combinatorics) -
dominique.rossin[at]lix.polytechnique.fr
- Bruno Salvy (computer algebra, analysis of algorithms, combinatorics) -
bruno.salvy[at]inria.fr
- David Savourey (operational research)
- Olivier Serre (algorithmics, logic)
- Gilles Schaeffer (algorithmic, combinatorics) -
schaeffe[at]lix.polytechnique.fr
- Benjamin Smith (cryptology, security, arithmetic) - benjamin.smith[at]lix.polytechnique.fr
- Jean-Marc Steyaert (algorithmic, bio-informatics) -
steyaert[at]lix.polytechnique.fr
- Jean-Pierre Tillich (cryptology)
- Marc Townsley (networks)
- Michalis Vazirgiannis (data & web mining) - mvazirg[at]lix.polytechnique.fr
- Benjamin Werner (proof, logic, safety) - werner[at]lix.polytechnique.fr
However, the proposition of internship must be validated, in fine, by the person responsible of internships Olivier Bournez,

For information:

The list of internships in 2015

(initial subjects)

The list of internships in 2014

(initial subjects)

The list of internships in 2013

(initial subjects)

The list of internships in 2012

The list of internships in 2011