Master in Computer Science, 2009/2010
Presentation and Agenda
Courses are organized in three tracks:
- Mathematical computer science, or Info-Math,
- Algorithms,
- Models and optimization for emerging infrastructures.
However students have full freedom in mixing and matching
courses from different tracks. In particular, there is no
timetable overlap between courses in different tracks.
Course units include:
- Basic lectures, with 32h of lectures and 32h of labs, for 5 ECTS credits,
- Research lectures, with 24h of lectures, for 4 ECTS credits,
- Winter school courses, with 24h of lectures, for 2 ECTS credits,
The tentative agenda is the following:
- 07/09/2009: beginning of term
- 14/09/2009 to 18/12/2009: courses
- 4/01/2010 to 8/01/2010: presentation of research readings
- 11/01/2010 to 19/02/2010: winter schools
- 22/02/2010 to 07/2010: internships / international exchange
Basic courses
Each of the following module is worth 5 ECTS credits.
|
Info-Math |
Algo |
Models and Optim |
| Project |
|
|
|
| Computer-assisted proofs |
|
|
|
| Algorihtmic complexity |
|
|
|
| Computer arithmetic |
|
|
|
| Parallel algorithms |
|
|
|
| Performance evaluation |
|
|
|
| Network algorithms |
|
|
|
| Compilation |
|
|
|
| Distributed systems |
|
|
|
Research courses
Each of the following module is worth 4 ECTS credits.
|
Info-Math |
Algo |
Models and Optim |
| Logic and programming |
|
|
|
| Implicit complexity |
|
|
|
| Paving |
|
|
|
| Euclidean lattices |
|
|
|
| Certified linear algebra |
|
|
|
| Multiple precision |
|
|
|
| Scheduling |
|
|
|
| Sparse matrices |
|
|
|
| Advanced topics in compilation |
|
|
|
| Grid computing |
|
|
|
| Traffic modelling |
|
|
|
| Large graphs |
|
|
|
Winter schools
Each of the following course is worth 2 ECTS credits.
|
Info-Math |
Algo |
Models and Optim |
| Game semantics and linear logic |
|
|
|
| Efficient algorithms, quantum algorithms |
|
|
|
| Algorithmic geometry |
|
|
|
|
| Emerging architectures |
|
|
|
| Scalable computing |
|
|
|
| Game theory for networks |
|
|
|