M2 2015-2016

Year 2015-2016

The goal of this Master program is to provide a wide choice of high quality courses in computer science ranging from the most theoretical aspects to applications. It is open to students having achieved a 4th year degree in Science (Master 1) who wish to deepen their understanding of Computer Science. The typical year starts with courses during the fall term, followed by several (24h, week long) winter schools, and achieved by a 20 weeks research internship. Courses and materials are provided in English to encourage foreign students to join our program. Academic tutoring is provided to every student for finding internships, choosing courses, and providing guidance all along the year.

  • List of courses (for full description follow the link CRxx):

CR01 Advanced Cryptographic Primitives, Damien Stehlé and Benoit Libert.

CR02 Resilient and Energy-Aware Scheduling Algorithms, Anne Benoit.

CR03 Network Algorithms for Molecular Biology, Marie-France Sagot.

CR04 Quantum Information and Computation, Pascal Degiovanni, Omar Fawzi and Natacha Portier.

CR05 Tilings: between Dynamical Systems and Computability, Nathalie Aubrun and
Mathieu Sablik.

CR06 Algorithmic Number Theory, Guillaume Hanrot.

CR07 Computer Science and Privacy, Benoit Libert and Frédéric Prost.

CR08 Arithmetic Circuit Complexity, Pascal Koiran and Natacha Portier.

CR09 Distributed Computing: Models and Challenges, Eddy Caron, Gilles Fedak, Christian Perez and Laurent Lefevre.

CR10 Program Analysis, Safety Program Verification, Laure Gonnord and David Monniaux.

CR11 Rule-based Modeling of Biochemical Systems, Russ Harmer.

CR12 Coinductive Methods in Computer Science, Filippo Bonchi, Daniel Hirschkoff and Damien Pous.

CR13 Implicit Computational Complexity, Patrick Baillot, Olivier Laurent.

CR14 Finite Automata in Number Theory, Boris Adamczewski.

CR15 Complex Networks, Christophe Crespelle and Marton Karsai.

CR16 Signal Processing and Networks, Pierre Borgnat, Jean-Christophe Pesquet and Nelly Pustelnik.

CR17 Probabilistic Methods, with Applications to Graphs, Louis Esperet and Stéphan Thomassé.

CR18 Advanced Compilers: Loop Transformations and High-Level Synthesis, Tomofumi Yuki and Christophe Alias.

CR19 Fundamental Algorithms in Real Algebraic Geometry, Mohab Safey El Din and Jean-Charles Faugère.

  1. Winter schools: ici
  • Pre-course meeting: A (mandatory) pre-course meeting is planned on September 11 at 9am, Amphi B. The general organisation of the year and a description of the courses will be provided.
  • Schedule: Courses start September 14. Autumn holidays are October 26-30, Winter holidays are December 21-31. Exams will be held on January 4-8 2016. The schedule will be released soon.
  • Validation: To obtain their degree, CS Master students must complete 60 credits including the internship (30 credits), three winter schools (2 credits each) and four courses (4 credits each) in the above list. A typical choice is 6 courses, 3 schools and the internship; the extra courses can be chosen either in the CS courses or in the other departments. To meet the quality requirements of our program, the course choices must be approved by the academic tutor and the head of the Master 2 program. Administrative registration is mandatory.
  • Complex System program.

    The “Complex Networks” M2 master program organised by IXXI/ENS Lyon provides an innovative training for students who are interested in the interdisciplinary research of complex networks and modeling of complex systems. This program maintains a balance between different disciplines by combining courses from the fields of biology, computer science, mathematics, physics and sociology. Students from all of these disciplines are welcome to participate; the student will follow both the ”Complex Networks” program and part of their own M2: Computer Science, Physics, Bioscience or Mathematics. Follow this link for further details.

Poste d’ATER pour 2017-2018

Poste ATER LIP/ENS Lyon, section 27
Un poste d’ATER pour l’année 2017-2018 sera ouvert au concours prochainement, avec enseignement au département d’informatique de l’ENS de Lyon et recherche au LIP.

Details :
Toutes les informations sur la procédure de recrutement sont disponible sur le site de l’ENS de Lyon

Profil enseignement :
L’enseignant recruté assurera principalement des TD et TP dans les formations dispensées en L3 et en M1 aux étudiants d’informatique de l’ENS de Lyon. On s’attachera à ce que les enseignements soient connexes au projet et à la thématique de recherche des candidats.

Profil recherche :
Intégration dans une des équipes de recherche du laboratoire de l’informatique du parallélisme (LIP). Le projet de recherche sera défini en lien avec la ou le responsable de l’équipe choisie.

Contacts :

Recherche : Guillaume Hanrot, directeur du LIP, Guillaume.Hanrot@ens-lyon.fr

Enseignement : Nicolas Trotignon, directeur du DI, nicolas.trotignon@ens-lyon.fr

ER01: Randomized Algorithms (7-11 décembre)

Date : 7-11 décembre 2015

Intervenants: Joel Ouaknine, Ben Worrell et Stefan Kiefel (Oxford).
Contact local: Pascal Koiran

(Un résumé du contenu se trouve sur la version anglaise de cette page.)

Voici l’emploi du temps :


Monday: 9:30 – 11:30 am and 1:30 – 3:30 pm
Tuesday: 9 – 11:30 am, 1:30-3:30 pm and 4-6 pm.
Wednesday: 9-11:30 am and 1:30-3:30 pm.
Thursday: 9 am – 12:30 pm
Friday: 9 am – 12:30 pm and afternoon exam: 2 pm – 4 pm