WikiMPRI - cours

2011-2012-c-1-22

Anonymous (anonymous@undisclosed.example.com) — 2012-10-03T09:44:35+00:00

Basics of Verification (48h, 6 ECTS) In charge: Paul Gastin (LSV, ENS Cachan). Lecturers Paul Gastin (lectures), Stefan Schwoon (lectures), Sylvain Schmitz (exercises). Language The default language is French. But the lectures may be given in English if attended by non French-speaking students.

2011-2012-cours2

Anonymous (anonymous@undisclosed.example.com) — 2012-06-26T14:15:36+00:00

List of available level 2 modules for the academic year 2011-12 Module Title Nb. H ECTS Period(s) Person(s) in charge Teaching Language2.1 Logique linéaire et paradigmes logiques du calcul Linear logic 48 6 1 - 2 R. Di Cosmo 3/4 French, 1/4 English

2012-2013-c-1-22

Anonymous (anonymous@undisclosed.example.com) — 2013-10-03T11:57:37+00:00

2012-2013-c-2-15

Anonymous (anonymous@undisclosed.example.com) — 2013-07-09T09:23:06+00:00

Analyse d'algorithmes (48h, 6 ECTS) Premier cours : Mercredi 19 septembre 2012, de 16h15 à 19h15 (Chevaleret) Responsable : Michèle Soria Plan du cours et intervenants prévus pour 2012-2013 Partie 1 * Modèles réguliers : Michèle Soria

2012-2013-cours2

Anonymous (anonymous@undisclosed.example.com) — 2013-10-15T13:55:21+00:00

List of available level 2 modules for the academic year 2012-13 Module Title Nb. H ECTS Period(s) Person(s) in charge Teaching LanguageBreakable2.1 Logique linéaire et paradigmes logiques du calcul Linear logic 48 6 1 - 2 R. Di Cosmo 3/4 French by default, 1/4 English

2013-2014-c-1-22

Anonymous (anonymous@undisclosed.example.com) — 2017-09-11T17:04:39+00:00

Basics of Verification (60h, 6 ECTS) In charge: Paul Gastin (LSV, ENS Cachan). Lecturers Paul Gastin (lectures), Stefan Schwoon (lectures), Sylvain Schmitz (exercises), Daniel Stan (exercises). Research internships * Verification of concurrent systems with data structures * Probabilistic specifications * Synthesis of Distributed Systems with Parameterized Network Topology Language The default language is French. But the lectures may be given in English if attended by non French…

2013-2014-cours2

Anonymous (anonymous@undisclosed.example.com) — 2014-03-20T12:27:01+00:00

Level 2 modules Level 2 modules offer a specialised training constitutive of a true introduction to research; they require a good knowledge of the contents of the level 1 modules. Each level 2 full module is taught over the course of a semester, represents 75 student-hours (typically 50 contact hours and 25 hours of private study), and entitles students to 6 ECTS credits. Half modules are taught either 1.5h/week over the course of the semester or 3h/week over half the semester. Each such modul…

2014-2015-c-1-22

Anonymous (anonymous@undisclosed.example.com) — 2015-09-09T12:18:01+00:00

Basics of Verification (60h, 6 ECTS) In charge: Étienne Lozes and Stefan Schwoon (LSV, ENS Cachan). Lecturers Étienne Lozes, Thomas Chatain, Stefan Schwoon, Daniel Stan. Research internships * Verification of concurrent systems with data structures * Probabilistic specifications * Synthesis of Distributed Systems with Parameterized Network Topology Language The default language is French. But the lectures may be given in English if attended by non French-speaking students.

2014-2015-cours2

Anonymous (anonymous@undisclosed.example.com) — 2015-03-17T20:17:27+00:00

2015-2016-c-1-22

Anonymous (anonymous@undisclosed.example.com) — 2016-09-15T14:15:24+00:00

Basics of Verification (60h, 6 ECTS) In charge: Stefan Schwoon (LSV, ENS Cachan). Lecturers in 2015—2016 Thomas Chatain, Sylvain Schmitz, Stefan Schwoon, Daniel Stan. Language The default language is French. But the lectures may be given in English if attended by non French-speaking students. Motivations and main objectives

2015-2016-cours2

Anonymous (anonymous@undisclosed.example.com) — 2016-03-22T15:45:18+00:00

2016-2017-c-1-22

Anonymous (anonymous@undisclosed.example.com) — 2017-09-11T15:49:18+00:00

Basics of Verification (60h, 6 ECTS) In charge: Stefan Schwoon (LSV, ENS Cachan). Lecturers in 2016—2017 Thomas Chatain, Marie Fortin, Philippe Schnoebelen, Stefan Schwoon. Language The default language is French. But the lectures may be given in English if attended by non French-speaking students. Motivations and main objectives

2016-2017-cours2

Anonymous (anonymous@undisclosed.example.com) — 2017-07-24T11:48:24+00:00

List of level 2 modules Courses marked with a (S) are suspended in the academic year 2016-2017 Module Title Nb. H ECTS Period(s) Nb. Week H/Week Person(s) in charge Teaching LanguageBreakable2.1 Logique linéaire et paradigmes logiques du calcul Linear logic and logical paradigms of computation

2017-2018-c-1-22

Anonymous (anonymous@undisclosed.example.com) — 2018-09-20T16:06:40+00:00

Basics of Verification (60h, 6 ECTS) In charge: Stefan Schwoon (LSV, ENS Cachan). Lecturers in 2017—2018 Paul Gastin, Stefan Schwoon, Marie Fortin. Language The default language is French. But the lectures may be given in English if attended by non French-speaking students. Motivations and main objectives

2017-2018-cours2

Anonymous (anonymous@undisclosed.example.com) — 2018-07-10T12:48:01+00:00

2018-2019-c-1-22

Anonymous (anonymous@undisclosed.example.com) — 2019-10-04T16:16:18+00:00

Basics of Verification (60h, 6 ECTS) In charge: Stefan Schwoon (LSV, ENS Cachan). Lecturers in 2018—2019 Paul Gastin, Stefan Schwoon, Marie Fortin. Language The default language is French. But the lectures may be given in English if attended by non French-speaking students. Motivations and main objectives

2019-2020-c-1-22

Anonymous (anonymous@undisclosed.example.com) — 2020-09-01T14:12:46+00:00

Basics of Verification (60h, 6 ECTS) In charge: Stefan Schwoon (LSV, ENS Cachan). Lecturers in 2019—2020 Paul Gastin, Stefan Schwoon, Nathan Thomasset. Language The default language is French. But the lectures may be given in English if attended by non French-speaking students. Motivations and main objectives

c-1-1

Anonymous (anonymous@undisclosed.example.com) — 2011-07-12T12:11:23+00:00

Algorithmique Resp.: A. Muscholl Objectifs Maîtriser les bases de l'algorithmique des graphes et des structures de données associées. Plan du cours * Algorithmes dans les graphes : * structures de données, * parcours de graphes, *

c-1-2

Anonymous (anonymous@undisclosed.example.com) — 2011-07-12T12:22:43+00:00

Automates avancés et applications Resp. : E. Asarin Objectifs Les automates sont extrêmement utiles pour modéliser des phénomènes complexes et pour développer des algorithmes efficaces sur ces modèles. Le plus souvent, on utilise des extensions de la notion classique d'automate fini. Ces extensions peuvent porter sur l'objet à reconnaître : mot infini, arbre, fonction, relation,

c-1-3

Anonymous (anonymous@undisclosed.example.com) — 2011-07-12T12:23:43+00:00

Les années précédentes * Année 2009-2010 * Année 2008-2009

c-1-4

Anonymous (anonymous@undisclosed.example.com) — 2011-10-25T15:01:07+00:00

Compilation

c-1-5

Anonymous (anonymous@undisclosed.example.com) — 2011-07-12T12:27:26+00:00

Probabilités et systèmes à événements discrets Resp.: F. Baccelli Objectifs Le but de ce cours est double : * fournir un exposé des bases du calcul des probabilités discrètes; ces bases sont nécessaires pour l'étude des systèmes à événements discrets stochastiques et sont utiles, voire essentielles, dans de nombreux cours de M2.

c-1-6

Anonymous (anonymous@undisclosed.example.com) — 2011-07-12T13:32:21+00:00

c-1-7

Anonymous (anonymous@undisclosed.example.com) — 2011-07-12T12:28:58+00:00

c-1-8

Anonymous (anonymous@undisclosed.example.com) — 2011-07-12T12:29:21+00:00

c-1-9

Anonymous (anonymous@undisclosed.example.com) — 2011-07-12T12:29:42+00:00

c-1-11

Anonymous (anonymous@undisclosed.example.com) — 2011-09-02T14:00:38+00:00

Bases Géométriques de l'Informatique Resp.: Objectifs Ce cours introduit les bases géométriques et algorithmiques des domaines de l'informatique où la géométrie joue un rôle fondamental, en particulier la géométrie algorithmique et la vision artificielle. La première partie du cours est consacrée à la géométrie discrète et aux objets, techniques et applications de la géométrie algorithmique. On y développe en particulier l'étude des…

c-1-13

Anonymous (anonymous@undisclosed.example.com) — 2023-01-03T10:23:26+00:00

Initiation à la cryptologie Resp. : D. Pointcheval Objectifs Ce cours s'adresse aux étudiants ayant un goût pour l'algorithmique, à la fois dans ses aspects mathématiques et dans ses aspects pratiques. Son but est d'enseigner la problématique de la cryptologie, et les principaux outils utilisés par la cryptologie pour proposer des solutions aux problèmes de sécurité.

c-1-17

Anonymous (anonymous@undisclosed.example.com) — 2025-09-16T05:54:31+00:00

Complexité avancée (48h, 7 ECTS) Responsable : Jean Goubault-Larrecq (LSV, ENS Cachan). Cette page est obsolète. À partir de la rentrée 2025 la description du cours est accessible sur le nouveau serveur.

c-1-18

Anonymous (anonymous@undisclosed.example.com) — 2024-12-04T19:46:35+00:00

Tree automata and applications (24h, 4 ECTS) Teachers: * Laurent Doyen (lecture and exercices) Time/location: Tuesdays, 8:30--12:45. Cachan room Cournot C321 Planned Contents The course introduces a generalisation of finite automata to finite trees. Tree automata provide an algorithmic toolbox for reasoning about infinite sets of trees, allowing in particular to solve formal logic problems. They have concrete applications, for instance in XML processing and modelling in computational …

c-1-21

Anonymous (anonymous@undisclosed.example.com) — 2012-11-02T18:14:51+00:00

Projet de programmation réseau In charge : Benoît Barbot and César Rodríguez. Location, Calendar, and Teaching Stuff The courses will take place during the fall semester at ENS Cachan, building Cournot, room 411. Course meetings are on Mondays from 4.15pm to 7.15pm, starting on September 17

c-1-22

Anonymous (anonymous@undisclosed.example.com) — 2020-11-06T13:49:09+00:00

Basics of Verification (60h, 7 ECTS) In charge: Stefan Schwoon (LSV, ENS Cachan). Lecturers in 2020—2021 Paul Gastin, Stefan Schwoon, Nathan Thomasset. Language The default language is French. But the lectures may be given in English if attended by non French-speaking students. Motivations and main objectives

c-1-24

Anonymous (anonymous@undisclosed.example.com) — 2023-12-18T21:59:38+00:00

Probabilistic Aspects of Computer Science (60h, 7 ECTS) Coordination: Serge Haddad (LMF, ENS Paris-Saclay) Instructors * Serge Haddad (lectures part 1) * Stéphane Le Roux (exercices part 1) * Thomas Nowak (lectures part 2) * Gabriel Le Bouder (exercises part 2) Motivation and Main Objectives

c-1-30

Anonymous (anonymous@undisclosed.example.com) — 2013-09-09T12:59:41+00:00

Machine Learning (48h, 6 ECTS) In charge: Michèle Sebag (CNRS, LRI - U. Paris-Sud). Lecturers * Michele Sebag, CNRS, U. Paris-Sud (lectures) * Benoît Barbot, ENS-Cachan (TD/TP) Language The lectures will be given in French unless attended by non French-speaking students. Slides are in English.

c-1-31

Anonymous (anonymous@undisclosed.example.com) — 2025-04-15T08:06:10+00:00

Software engineering (48h, 7 ECTS) Teachers: Mihaela Sighireanu and Thomas Chatain (LMF, ENS Paris-Saclay). If you're attending, check the course webpage for pedagogical information. Language This course is taught in English on demand. Motivations and main objectives In order to develop software applications (e.g., research prototypes) it is necessary but rarely sufficient to know a programming language. The purpose of this course is to learn software engineering tools and methodologies wh…

c-1-32-1

Anonymous (anonymous@undisclosed.example.com) — 2016-09-10T20:05:19+00:00

Algorithmics and bioinformatics (26h, 3 ECTS) In charge: Philippe Gambette (LIGM, Univ. Paris-Est Marne-la-Vallée).

c-1-32-2

Anonymous (anonymous@undisclosed.example.com) — 2016-09-10T20:05:04+00:00

Algorithmics and bioinformatics (26h, 3 ECTS) In charge: Philippe Gambette (LIGM, Univ. Paris-Est Marne-la-Vallée).

c-1-32

Anonymous (anonymous@undisclosed.example.com) — 2025-09-05T11:06:14+00:00

Computational Bioengineering (60h, 8 ECTS) Instructors * Matthias Függer * Thomas Nowak Course website Information regarding the course can be found on the course website:

c-1-33

Anonymous (anonymous@undisclosed.example.com) — 2014-09-16T09:38:04+00:00

Rewriting Techniques 24 hours, 3 credits Schedule: Monday 14:00-18:15. First lecture on november 17 Location: Cachan C509-511 2014/15 Teaching staff * Hubert Comon-Lundh * Jeremy Dubut Contents (preliminary) * Kruskal theorem and termination proofs

c-1-34

Anonymous (anonymous@undisclosed.example.com) — 2024-12-04T19:44:52+00:00

Networks (24h, 4 ECTS) Teacher: Mihaela Sighireanu (LMF, ENS Paris-Saclay) and Antony Juton (ENS Paris-Saclay). Contents This module presents the main concepts used in computer networks like addressing, data exchange, routing, and transport protocols. The presentation employs a formal approach by presenting these concepts using formal models like message sequence charts, process algebra, communicating automata. The module also introduces the socket programming and proposes as projet the prog…

c-1-36

Anonymous (anonymous@undisclosed.example.com) — 2025-11-17T13:57:07+00:00

Initiation to research Person in charge: Philippe Schnoebelen General presentation The “Initiation to Research” course (3 ECTS) embeds you in two successive working groups (called “workshops”) tackling some research problem under the guidance of a senior superviser. Each group meets once a week in order to assess progress, fix/update its short and long-term goals, assign tasks to participants. Research work is done between these meetings, working either alone or in some subgroup. Between the …

c-1-39

Anonymous (anonymous@undisclosed.example.com) — 2024-09-11T09:01:21+00:00

Logical Aspects of Artificial Intelligence (48h, 4 ECTS + 4 ECTS) Teachers: Stéphane Demri (LMF, ENS Paris-Saclay) & Mihaela Sighireanu (LMF, ENS Paris-Saclay) Contents This module presents the logical aspects of AI that are known to be essential to reason formally and symbolically on logical theories and for knowledge representation. Along the years, the logical aspects of AI had their own pace of development, in parallel to what has been done in formal logic. New scientific questions h…

c-2-1

Anonymous (anonymous@undisclosed.example.com) — 2024-02-22T10:46:54+00:00

Logique linéaire et paradigmes logiques du calcul (48h, 6 ECTS) Responsables : Delia Kesner et Dale Miller Plan du cours et intervenants prévus pour 2023-2024 Le cours commence le lundi 12 septembre! * Introduction à la Logique Linéaire et Recherche de preuve (12h, Dale Miller :

c-2-2

Anonymous (anonymous@undisclosed.example.com) — 2024-11-27T22:17:44+00:00

Modèles des langages de programmation (48h, 6 ECTS) Responsables : Thomas Ehrhard et Paul-André Melliès Plan du cours et intervenants prévus pour 2024 - 2025 * Catégories et logique linéaire, domaines de Scott, espaces de cohérence, jeux de dialogue. (18h, Paul-André Melliès)

c-2-3-2

Anonymous (anonymous@undisclosed.example.com) — 2020-01-11T22:32:04+00:00

Foundations of privacy (24h, 3 ECTS) Teachers for 2019-20 * Catuscia Palamidessi, LIX, Ecole Polytechnique * Pablo Piantanida, CentraleSupélec Exams * November 26, 12h45 - 15h45 * Only printouts of the slides and hand-written notes are allowed. Goals The course aims at presenting modern approaches to privacy protection, in a wide range of applications such as statistical databases, location based systems, machine learning, and information flow analysis. We will put a particular …

c-2-3-3

Anonymous (anonymous@undisclosed.example.com) — 2011-07-12T17:26:38+00:00

Bigraphs -- unifying models of mobile interaction (12h, 2 ECTS) Responsible: Robin Milner, professor, Ecole Polytechnique The course will be held in english. The venue is Room OC2, 175 rue du Chevaleret; time 16h15--19h15; dates 8,15,22,29 January 2007. All are welcome.

c-2-3

Anonymous (anonymous@undisclosed.example.com) — 2025-01-20T12:29:39+00:00

Concurrency (24h, 3 ECTS) Course director: Emmanuel Haucourt Academic year 2024 - 2025 Teacher Emmanuel Haucourt () Goals In view of studying concurrency in a continuous setting, we introduce topology, geometry, and order theory needed to define a semantics of a restriction of the language introduced by E. W. Dijkstra.

c-2-4-1

Anonymous (anonymous@undisclosed.example.com) — 2011-07-12T17:26:38+00:00

Langages de programmation - Programmation par Contraintes (24h, 3 ECTS) Responsable : Sylvain Soliman (INRIA) Intervenants * Programmation concurrente et linéaire avec contraintes (18h, Sylvain Soliman, INRIA Paris-Rocquencourt) * Fondements logiques, contraintes globales, symétries (6h,

c-2-4-2

Anonymous (anonymous@undisclosed.example.com) — 2023-07-27T14:09:02+00:00

Functional programming and type systems (48h, 6 ECTS) One-Line Summary For detailed information about this course, please go to the course's page. Aim This course presents the principles, formalisms, and mathematical techniques that underlie many of today's typed programming languages, including OCaml, Haskell, and Rust.

c-2-4

Anonymous (anonymous@undisclosed.example.com) — 2024-02-09T14:05:57+00:00

Langages de programmation (48h, 6 ECTS) This is an old, obsolete page: please go to Functional programming and type systems (48h, 6 ECTS) instead. Responsables : Giuseppe Castagna et Xavier Leroy Plan du cours et intervenants prévus pour 2005-2006 * Langages fonctionnels et impératifs François Pottier 15

c-2-5-1

Anonymous (anonymous@undisclosed.example.com) — 2011-07-12T17:26:38+00:00

Démonstration automatique I (24h, 3 ECTS) Responsables : Jean Goubault et Évelyne Contejean Intervenants prévus pour 2006-2007 * Jean Goubault-Larrecq (4 cours = 12h) * Évelyne Contejean (4 cours = 12h) Objectifs communs aux cours C-2-5-1 et C-2-1

c-2-5-2

Anonymous (anonymous@undisclosed.example.com) — 2011-07-12T17:26:38+00:00

Démonstration automatique II Responsable : Ralf Treinen Intervenants 2006-2007 * Évelyne Contejean (1 cours = 3 heures) * Ralf Treinen (5 cours = 15 heures) * Sylvain Conchon (2 cours = 6 heures) Objectifs communs aux cours C-2-5-1 et C-2-1 Le but de ce cours de fournir aux étudiants les bases nécessaires afin de pouvoir comprendre le fonctionnement de la plupart des outils de démonstration automatique développés en particulier dans le monde académique [[http://www.cs.miami.edu/~tptp/…

c-2-5

Anonymous (anonymous@undisclosed.example.com) — 2015-02-12T09:02:00+00:00

Démonstration automatique (24h, 3 ECTS) Responsables : Évelyne Contejean et Ralf Treinen Intervenants prévus pour 2014-2015 * Ralf Treinen (4 cours = 12h) * Mohamed Iguernelala (4 cours = 12 heures) Évaluation * Projet SMT (Mohamed Iguernelala) à rendre pour le 19/03/2015

c-2-6

Anonymous (anonymous@undisclosed.example.com) — 2025-07-28T08:42:17+00:00

Interprétation abstraite : application à la vérification et à l'analyses statique (48h, 6 ECTS) Responsable : Antoine Miné Organisation Pour l'année 2025-2026, le cours a lieu le lundi de 12h45 à 15h45 à l'Université Paris Cité, dans le bâtiment Sophie Germain, en salle 1004.

c-2-7-1

Anonymous (anonymous@undisclosed.example.com) — 2024-09-18T13:08:55+00:00

Fondements des systemes de preuves / Foundations of proof systems (24h, 3 ECTS) Responsable : Benjamin Werner, Gilles Dowek Language The course is in English (unless clearly only french speakers present) Teaching in 2024 - 2025 Benjamin Werner Main Page of the Course here Objectives This course is about the notion of formal proof in mathematics and in informatics. It presents several logical formalisms, including type theories, focusing on the fact that they are meant to be used in pro…

c-2-7-2

Anonymous (anonymous@undisclosed.example.com) — 2024-09-19T13:45:41+00:00

Proof assistants (24h, 3 ECTS) All information for the course 2024/25 iteration of the course can be found at . Please register for the course here. The course is taught by Yannick Forster and Théo Winterhalter. Overview Proof assistants have a wide range of applications from mathematical theorems (including some, like the four colour theorem, that have no proof without the use of a computer) to program verification (which can be crucial for critical software, e.…

c-2-7

Anonymous (anonymous@undisclosed.example.com) — 2011-07-13T12:38:18+00:00

Fondements des systemes de preuves (24h, 3 ECTS) Responsable : Gilles Dowek Plan du cours et intervenants prévus pour 2005-2006 * ??? (14h, Gilles Dowek * ??? (10h, Alexandre Miquel (essentiellement TD) Assistants de preuves (24h, 3 ECTS)

c-2-8-1

Anonymous (anonymous@undisclosed.example.com) — 2023-07-28T13:16:14+00:00

Cette année, le cours 2.8.1 a lieu dans le cadre du cours 2.8 (qui unifie 2.8.1 et 2.8.2)

c-2-8-2

Anonymous (anonymous@undisclosed.example.com) — 2024-11-30T08:43:13+00:00

Systèmes cyber-physiques et leur vérification / Cyber-physical systems and their verification(2024-2025) * The lecturers for 2024-2025 are Eugene Asarin and Laurent Fribourg * This course is 24h and corresponds to 3 ECTS. * Lectures will take place on Thursday, 12:45-15:15, in Bat. Sophie Germain, Room 1002.

c-2-8

Anonymous (anonymous@undisclosed.example.com) — 2025-08-22T09:44:27+00:00

Techniques avancées de vérification / Advanced techniques of verification (2025-2026) * This course is 48h and corresponds to 6 ECTS. * Lectures will take place on Thursday, 12:45-15:45, in Bat. Sophie Germain, Room 1004. * The first lecture takes place on September 18, 2025.

c-2-9-1

Anonymous (anonymous@undisclosed.example.com) — 2025-08-28T09:24:56+00:00

Aspects Algorithmiques de la Théorie des Beaux préordres / Algorithmic Aspects of WQO Theory (24h, 3 ECTS) * Où, quand ? / Where, when?: In 2025, the course takes place on Wednesdays from 8h45 to 11h45, starting on September 17 2024, building Sophie Germain in

c-2-9-2

Anonymous (anonymous@undisclosed.example.com) — 2025-03-04T11:10:15+00:00

2.9.2: Fondements Vérification algorithmique des programmes/ Algorithmic verification of programs (24h, 3 ECTS) Responsable / Course manager: Ahmed Bouajjani (IRIF, Paris 7 & CNRS) Enseignants / Teachers 2024-25: Ahmed Bouajjani (IRIF, Paris 7 & CNRS) Constantin Enea (LIX, Ecole Polytechnique)

c-2-9

Anonymous (anonymous@undisclosed.example.com) — 2012-03-24T17:24:22+00:00

Verification of dynamic and parameterized systems (48h, 6 ECTS) People in charge : (LSV, ENS de Cachan), responsible for this year, and, (LIAFA, Univ. Paris 7) and, (LSV, ENS de Cachan). The lectures take place on Tuesday from 16h15 until

c-2-10

Anonymous (anonymous@undisclosed.example.com) — 2025-08-27T16:15:22+00:00

Aspects algorithmiques de la combinatoire (48h, 6 ECTS) Responsable : Guillaume Chapuy Le cours prendra la forme de séances de 2h30 et aura lieu le vendredi de 13h à 15h30 (le cours a lieu au milieu du créneau 12h45-15h45). Les cours auront probablement lieu en anglais, sauf si l'auditoire est francophone. Les supports de cours et sujet d'examen sont en anglais.

c-2-11-1

Anonymous (anonymous@undisclosed.example.com) — 2025-01-20T01:14:25+00:00

**Parameterized Algorithms**\\ (2024/2025, 24h, 3 ECTS)\\ Instructors: Pierre Aboulker (ENS Paris-ULM) and Valia Mitsou (IRIF, Université Paris Cité) Language of the course: English by default Short Description of the Course: Parameterized complexity is a branch of computational complexity offering us tools in order to attack NP-hard problems, but also in order to solve more efficiently problems belonging in P. In parameterized complexity, we perform a more refined analysis of the algorithm…

c-2-11-2

Anonymous (anonymous@undisclosed.example.com) — 2024-10-02T07:30:40+00:00

Randomness in Complexity (24h, 3 ECTS) Course manager: Adrian Vladu (IRIF) Course Outline 2024-2025 Main topics * Approximation Algorithms Instructors * Chien-Chung Huang * David Saulpic Organization * 8 lectures, each is 3 hours long. * Schedule is to be determined. * Lectures will be offered in English upon request.

c-2-11

Anonymous (anonymous@undisclosed.example.com) — 2016-08-02T07:14:56+00:00

Randomness in Complexity (48h, 6 ECTS) Course manager: Frédéric Magniez ( LIAFA) Course Outline 2015-2016 * Introduction (2 lectures) * Cryptography and complexity (4 lectures) * Interactive proofs, PCP, inapproximability (4 lectures) * Other topics among online algorithms, property testing, algorithmic game theory, learning theory (2 lectures)

c-2-12-1

Anonymous (anonymous@undisclosed.example.com) — 2025-03-12T10:45:10+00:00

__Techniques in Cryptography and Cryptanalysis__ Instructors for 2024 - 2025: Phong Nguyen (DR @ Inria) and Brice Minaud (CR @ Inria) Language of Instruction: English for slides and lecture notes. English or French for lectures, depending on the audience.

c-2-12-2

Anonymous (anonymous@undisclosed.example.com) — 2024-11-08T09:08:35+00:00

Algorithmes arithmétiques pour la cryptologie / Arithmetic algorithms for cryptography (24h, 3 ECTS) Responsable : B. Smith. Équipe pédagogique Benjamin SmithCRINRIALIX Planning, année/year 2024-2025 Friday mornings from 8h45 to 11h45 (in Period 1) in Bâtiment Sophie Germain (P7), salle 1002.

c-2-12

Anonymous (anonymous@undisclosed.example.com) — 2011-07-12T20:45:18+00:00

Cryptologie (48h, 6 ECTS) Responsables : G. Hanrot, D. Pointcheval Plan du cours et intervenants prévus pour 2008-2009 * Algorithmique des entiers et des polynômes (9h, Emmanuel Thomé * Courbes elliptiques et hyperelliptiques (9h, Ben Smith

c-2-13-1

Anonymous (anonymous@undisclosed.example.com) — 2023-12-05T10:31:00+00:00

Polynomial systems, computer algebra and applications (24h, 3 ECTS) Responsable : Jean-Charles Faugère Teachers * Jean-Charles Faugère: Polynomial systems, Gröbner bases, Applications in Cryptography. * Mohab Safey El Din: Polynomial systems, Gröbner bases, Applications in geometry and engineering sciences.

c-2-13-2

Anonymous (anonymous@undisclosed.example.com) — 2025-02-17T08:53:01+00:00

**Error-correcting codes and applications to cryptography (24h, 3 ECTS)** Instructors: Anne Canteaut (responsable), Alain Couvreur, Thomas Debris Objectives The aim of this course is to present common issues essential to the theory of error-correcting codes and to cryptology (symmetric cryptography and public-key cryptosystems), with algorithmic and computational aspects.

c-2-13

Anonymous (anonymous@undisclosed.example.com) — 2011-07-12T17:26:38+00:00

Codes correcteurs d'erreurs, calcul formel: applications à la cryptologie (48h, 6 ECTS) Responsables : Jean-Charles Faugère et Jean-Pierre Tillich Intervenants 2008-2009

* Jean-Charles Faugère: systèmes d'équations algébriques, leur résolution efficace. * Ludovic Perret: Applications en Cryptographie.

c-2-14-1

Anonymous (anonymous@undisclosed.example.com) — 2025-09-01T09:36:43+00:00

Computational Geometry and Topology : (3 ECTS) Contact : Steve Oudot . Teachers Steve Oudot, INRIA Saclay - . Pooran Memari, LIX/Polytechnique - . Goals In the past 20 years, the field of computational geometry has undergone a vast expansion, including new topics such as high-dimensional geometry, low-dimensional topology, or topological data analysis. This course is an introduction to the field of computational geometry, with a balance between classic and new topics. On the classic si…

c-2-14-2

Anonymous (anonymous@undisclosed.example.com) — 2011-07-13T12:14:42+00:00

Géométrie, Algorithmes et Combinatoire (24h, 3 ECTS) Responsable: M. Pocchiola (Equipe Combinatoire & Optimisation, U. Pierre et Marie Curie) Intervenants prévus pour 2010-2011 Éric Colin de Verdière (12h) et Michel Pocchiola (12h) Emploi du temps Le cours se déclinera en 8 séances de 3 heures les lundis 13 et 20 septembre, 4,11,18 et 25 octobre et 8 et 15 novembre de 16H15 à 19H15 en salle R à l'Ecole normale supérieure de la rue d'Ulm

c-2-14

Anonymous (anonymous@undisclosed.example.com) — 2011-07-12T17:26:38+00:00

Géométrie algorithmique (48h, 6 ECTS) Responsables : Jean-Daniel Boissonnat et Michel Pocchiola Plan du cours et intervenants prévus pour 2005-2006 * Topologie algorithmique. (12h, Michel Pocchiola, les 26 oct. et 02, 09 et 16 nov. reporté au 15 fév. 06

c-2-15

Anonymous (anonymous@undisclosed.example.com) — 2025-08-29T08:52:06+00:00

Analysis of Algorithms (48h, 6 ECTS) First lesson: Monday 22 September 2025, at 16h15 building Sophie Germain, room 1002 Organizer: Élie de Panafieu Calendar for 2025 -- 2026 Part 1 * 22/09 unlabeled objects (Pablo Rotondo) * 29/09 unlabeled objects (Pablo Rotondo)

c-2-16

Anonymous (anonymous@undisclosed.example.com) — 2025-01-07T20:51:48+00:00

c-2-17-1

Anonymous (anonymous@undisclosed.example.com) — 2024-02-05T12:13:50+00:00

Fondements sur la modélisation des réseaux (24h, 3 ECTS) Responsable : Ana Busic Objectifs Le but de ce cours est double : * proposer des modèles mathématiques pertinents pour les réseaux de communications; * donner les bases théoriques permettant de mener à bien l'analyse de la dynamique de ces modèles.

c-2-17-2

Anonymous (anonymous@undisclosed.example.com) — 2011-07-12T17:26:38+00:00

Algorithmique distribuée pour les réseaux (24h, 3 ECTS) Responsable : Pierre Fraigniaud Langue du cours Le cours se déroulera en français, sauf s'il s'avère y avoir une forte demande pour l'anglais de la part de l'audience. Objectifs Le cours est principalement motivé par l'importance croissante que prennent les

c-2-17

Anonymous (anonymous@undisclosed.example.com) — 2011-07-13T12:28:04+00:00

Dynamique et algorithmique des réseaux (48h, 6 ECTS) Responsables : François Baccelli et Jean Mairesse Objectifs Le but de ce cours est double : * donner les bases scientifiques sur la théorie de la dynamique des réseaux ; * illustrer cette théorie par des exemples concrets dans le domaine des communications.

c-2-18-1

Anonymous (anonymous@undisclosed.example.com) — 2025-02-27T09:16:41+00:00

Course 2.18.1: Distributed Algorithms for Networks (24h, 3ECTS) Responsible of the course: Pierre Fraigniaud (Directeur de Recherche CNRS, IRIF, Université Paris Cité) Schedule: Unless specified otherwise, during the period from Sept. 19, 2024, to Feb. 27, 2025, the lectures will take place from 10:30 to 12:00 every Thursday morning, room 1002 of Building Sophie Germain (Université Paris Cité).

c-2-18-2

Anonymous (anonymous@undisclosed.example.com) — 2024-11-22T13:06:04+00:00

Cours 2.18.2: Shared-Memory Distributed Computing/Algorithmique distribuée avec mémoire partagée (24h, 3ECTS) Enseignants pour l'année 2024-25 / Teachers in charge for 2024-25 * Carole Delporte (IRIF, Université Paris Cité) * Lelia Blin (IRIF, Université Paris Cité) Sommaire / Summary

c-2-18-3

Anonymous (anonymous@undisclosed.example.com) — 2014-02-14T09:09:52+00:00

__Cours 18.2.3 Robust Concurrent Computing (24h, 3 ECTS)__ Responsables / Teachers in charge (2013-2014) Petr Kuznetsov, S3 INFRES, Telecom ParisTech Overview The curse of concurrency in computing is its complexity. Even a small-scale concurrent system may expose an amazingly complex behavior that would make it very challenging to formally reason about. But we have to meet the challenge! Due to inherent limitations of centralized computing, all computing systems nowadays is becoming dist…

c-2-18

Anonymous (anonymous@undisclosed.example.com) — 2011-07-13T12:32:12+00:00

Algorithmique répartie et tolérance aux défaillances (48h, 6 ECTS) Responsables : Joffroy Beauquier, Carole Delporte-Gallet et Laurent Fribourg Les cours seront en français. Une bibliographie et des documents en anglais seront disponibles pour les étudiants anglophones.

c-2-19

Anonymous (anonymous@undisclosed.example.com) — 2025-02-10T08:20:13+00:00

Coordinator: François Fages. * Jérôme Féret, * François Fages. Over the past two decades, formal methods from Theoretical Computer Science have been successfully applied in Life Sciences to decipher biological processes, mostly at the molecular and cellular levels. This course aims at presenting these methods and research issues in computational systems biology and synthetic biology. It is based on the vision of

c-2-20-1

Anonymous (anonymous@undisclosed.example.com) — 2024-11-21T20:36:04+00:00

Techniques de théorie des jeux en informatique / Game theory in computer science (24h, 3 ECTS) Responsable / Course supervisor Olivier Serre, directeur de recherche au CNRS, chercheur à l'IRIF Intervenants en 2024-2025 / Lecturers in 2024-2025

c-2-20-2

Anonymous (anonymous@undisclosed.example.com) — 2025-09-02T14:19:40+00:00

Dynamique symbolique (24h, 3 ECTS) Symbolic dynamics (24h, 3 ECTS) Responsable: V. Berthé, Directrice de recherches au CNRS Objectifs Ce cours présente des notions classiques relevant de la combinatoire des mots et de l'étude des systèmes dynamiques symboliques.

c-2-20

Anonymous (anonymous@undisclosed.example.com) — 2011-07-12T17:26:38+00:00

Jeux et logique (48h, 6 ECTS) Responsables : Anca Muscholl et Jean-Éric Pin Plan du cours et intervenants prévus pour 2005-2006 * Automates et mots infinis, logique premier ordre (12h, Jean-Eric Pin * Logique sur mots infinis, automates a parite, jeux et strategies (12h, Olivier Carton

c-2-21

Anonymous (anonymous@undisclosed.example.com) — 2011-07-12T17:26:38+00:00

Calculs algébriques et fonctionnels Resp.: G. Huet, D. Kesner Objectifs La réécriture repose sur l'idée de manipuler et de transformer des expressions, des valeurs, des propriétés et des méthodes. Les paradigmes de programmation fonctionnels, logiques, équationnels, par réécriture et orientés objets aussi bien que les langages concurrents et les assistants à la démonstration sont modélisés par ce type de transformations. La réécriture est aussi utilisée dans le raisonnement logique et mathém…

c-2-22

Anonymous (anonymous@undisclosed.example.com) — 2025-02-10T13:49:05+00:00

Efficient Algorithms in Computer Algebra (48h, 6 ECTS) French title: Algorithmes efficaces en calcul formel. Professors for 2024-2025: Alin Bostan, Pierre Lairez, Marc Mezzarobba, Vincent Neiger. Objectives Computer Algebra (also known as Symbolic Computation, or Calcul formel in French) consists in developing computer representations and manipulations of mathematical objects in an exact way, in contrast with traditional scientific computing, for example. As a counterpart of such exact algeb…

c-2-23-1

Anonymous (anonymous@undisclosed.example.com) — 2024-09-23T14:38:44+00:00

Systèmes Réactifs Synchrones (24h, 3 ECTS) Responsable : Marc Pouzet (ENS) Plan du cours et intervenants prévus pour 2024-2025 Timothy Bourke (12h) - Marc Pouzet (12h) - Langages de programmation pour la programmation des systèmes réactifs. - Exemples et applications avec les langages Lustre, Scade, Zélus et Simulink. - Fondements mathématiques: composition synchrone; suites et fonctions; machines de Moore et de Mealy; sémantique de Kahn. - Vérification formelle par model-checking. - Sémantiq…

c-2-24-1

Anonymous (anonymous@undisclosed.example.com) — 2024-11-06T15:26:43+00:00

Algorithms and Uncertainty (24h, 3 ECTS) Course Outline In many settings such as routing calls in a network, scheduling jobs in processors, or even trading in the stock market, the decision-maker operates in a status of uncertainty. The objective of the course is to study algorithmic models, techniques, analyses, and approaches that have been developed specifically for dealing with this class of problems. The course is will be focused on the following specific aspects of computation under unce…

c-2-24-2

Anonymous (anonymous@undisclosed.example.com) — 2025-09-02T19:16:43+00:00

**Solving Optimization Problems with Search Heuristics** Update for 2025/26: This year, the course will be held on Thursdays, in the late afternoon slots, i.e., Thursdays, 16:15-19:15 in room 1004. The first lecture is on September 18, 2025.

c-2-24

Anonymous (anonymous@undisclosed.example.com) — 2011-07-12T17:26:38+00:00

Ordonnancement (24h, 3 ECTS) Responsable : Philippe Baptiste Plan du cours et intervenants prévus pour 2005-2006 * ??? (12h, Ph. Baptiste * ??? (12h, C. Dürr Objectifs Le but de ce cours est de présenter les approches modernes de la théorie des problèmes d'optimisation combinatoire issus de l'informatique et des télécommunications.

c-2-25-1

Anonymous (anonymous@undisclosed.example.com) — 2011-07-12T17:26:38+00:00

Vision algorithmique I: reconstruction 3D (24h, 3 ECTS) Responsable : R. Keriven (CERTIS/ENPC) Plan et intervenants du cours 2007-2008 : * 7 séances de 3 heures en début de semestre (cf page du cours) * Intervenants: R.Keriven, P.Monasse (CERTIS/ENPC) Motivations et objectifs du cours

c-2-25-2

Anonymous (anonymous@undisclosed.example.com) — 2011-07-12T17:26:38+00:00

Vision Algorithmique II: Restauration et Segmentation (24h, 3 ECTS) Responsable : R. Deriche (INRIA, Sophia) Plan et intervenants du cours 2009-2010 : En deux parties, le mercredi de 12h45 à 15h45 à l'ENST (46, Rue Barrault) , à partir du 25/11/09 - Flots géométriques, approches variationnelles et applications (12h, Rachid Deriche - Mouvement, information priori et recalage (12h, Nikos Paragios

c-2-25

Anonymous (anonymous@undisclosed.example.com) — 2011-07-12T17:26:38+00:00

Vision algorithmique (48h, 6 ECTS) Responsables : R. Keriven, R. Deriche Plan du cours et intervenants prévus pour 2006-2007 * Attention premier cours le 27 septembre * Planning détaillé sur la Page Web du cours * Intervenants: Renaud Keriven, Rachid Deriche (12h), Nikos Paragios (12h)

c-2-26-1

Anonymous (anonymous@undisclosed.example.com) — 2025-02-20T21:31:10+00:00

Querying Data: Foundations and Practice (24H, 3 ECTS) Coordinator : Leonid Libkin Context Database theory has undergone several important transformations which are rarely reflected in courses, while having already found applications in database practice. In the 1980s and 90s the backbone of database theory was finite model theory, which has now been developed to the point of a collection of off-the-shelf tools that can be applied to analyze complexity and expressiveness of query languages. La…

c-2-26-2

Anonymous (anonymous@undisclosed.example.com) — 2022-12-05T09:55:16+00:00

2.26.2 Web Data Management - Gestion de données du Web The course Web site is on the Moodle of the INFRES department of Télécom Paris.

c-2-27-1

Anonymous (anonymous@undisclosed.example.com) — 2024-10-20T16:56:32+00:00

Structures informatiques et logiques pour la modélisation linguistique / Computational and Logical Structures for Linguistic Modelling Taught in 2024--2025 by Benoît Crabbé and Philippe de Groote. First semester course, on Mondays 12:45--15:45 in room 1004. Classes delivered in English if at least one student asks for it; in French otherwise.

c-2-28-1

Anonymous (anonymous@undisclosed.example.com) — 2011-07-12T17:26:38+00:00

Automates d'arbres et applications (24h de cours -- 3 ECTS) Responsable : Hubert Comon-Lundh Horaires des cours Les cours ont lieu de de 10h15 à 11h45 les lundi matin sur le site Chevaleret, en 0C2. Les cours seront en anglais si quelqu'un en fait la demande.

c-2-29-1

Anonymous (anonymous@undisclosed.example.com) — 2024-09-27T13:44:35+00:00

Théorie des graphes avancée (24h, 3 ECTS) Responsable: Reza Naserasr Schedule of course for 2023 -- 2024 Reza Naserasr(12h, Sept 18, Sept 25, Oct 02, Oct 09) Lecture Notes Here Matej Stehlik (12h, Oct 16, Oct 23, Oct 30, Nov 06) Exam: 27th November 2024, 12:45-15:45 in room SG 1004

c-2-29-2

Anonymous (anonymous@undisclosed.example.com) — 2025-04-17T10:26:08+00:00

Theory of practical graph algorithms (24h, 3 ECTS, period 2) Course director: Mauro Sozio Teachers for 2024-2025 Mauro Sozio (Professor, Telecom Paris, Institut Polytechnique de Paris, LTCI) sozio at telecom dash paris dot fr Laurent Viennot (Research Director, INRIA) laurent dot viennot at inria dot fr

c-2-30-1

Anonymous (anonymous@undisclosed.example.com) — 2011-07-12T17:26:38+00:00

Protocoles cryptographiques: preuves formelles et calculatoires (24h, 3 ECTS) Responsables : Stéphanie Delaune (LSV, ENS Cachan & CNRS & INRIA). et Cédric Fournet (MSR Cambridge & INRIA-MSR) Intervenants du cours 2008-2009 : * Bruno Blanchet (6h * Stéphanie Delaune (9h

c-2-30

Anonymous (anonymous@undisclosed.example.com) — 2025-02-13T13:23:00+00:00

Preuves de protocoles de sécurité / proofs of security protocols (48h, 6 ECTS) Responsable / Teacher in charge: Bruno Blanchet (Inria, Prosecco team). Intervenants en 2024-2025 / Teachers for 2024-2025 * Bruno Blanchet (24h) * Adrien Koutsos (12h) * Aymeric Fromherz (12h)

c-2-30en

Anonymous (anonymous@undisclosed.example.com) — 2011-07-13T09:24:20+00:00

French / Français Cryptographic protocols: formal and computational proofs (48h + 12h TD, 6 ECTS) Teachers in charge : Bruno Blanchet (LIENS, ENS Paris & CNRS & INRIA) and Stéphanie Delaune (LSV, ENS Cachan & CNRS & INRIA). Teachers for 2010-2011 : * Stéphanie Delaune (12h + 3h TD * Steve Kremer (12h + 3h TD

c-2-30f

Anonymous (anonymous@undisclosed.example.com) — 2011-07-13T09:24:31+00:00

Anglais / English Protocoles cryptographiques: preuves formelles et calculatoires (48h + 12h TD, 6 ECTS) Responsables : Bruno Blanchet (LIENS, ENS Paris & CNRS & INRIA) et Stéphanie Delaune (LSV, ENS Cachan & CNRS & INRIA) Intervenants du cours 2010-2011 : * Stéphanie Delaune (12h + 3h TD

c-2-31-1

Anonymous (anonymous@undisclosed.example.com) — 2013-02-26T15:40:14+00:00

Algorithms and Complexity of Constraint Satisfaction Problems (24h, 3 ECTS) Responsible : Miki Hermann (LIX, École Polytechnique) Teachers for 2012-2013 : * Manuel Bodirsky (12h) * Miki Hermann (12h) Motivation and Goals of the Cours Constraint Satisfaction Problems

c-2-33-1

Anonymous (anonymous@undisclosed.example.com) — 2022-12-01T14:03:40+00:00

2.33.1 Calculabilité dans les réseaux multiagents (24h, 3ECTS) Équipe pédagogique : * Olivier Bournez (Professeur à l'École polytechnique, LIX) * Bernadette Charron-Bost (Directrice de Recherche CNRS, DI ENS, École Normale Supérieure) * Sylvain Perifel (Maître de Conférence Université Paris 7, LIAFA)

c-2-33-2

Anonymous (anonymous@undisclosed.example.com) — 2017-10-30T11:44:53+00:00

Complexité des circuits Cours de 24h - 3 ECTS en seconde période. Enseignant : Sylvain Perifel. 10 cours de 2h30 le vendredi à 12h45 en salle 2036 (bâtiment Sophie Germain). Premier cours le vendredi 8 décembre 2017. Le cours sera donné en français, sauf si au moins un étudiant demande l'anglais et que personne ne s'y oppose.

c-2-33-3

Anonymous (anonymous@undisclosed.example.com) — 2024-11-17T18:19:48+00:00

Cours 2.33 2.33 Complexity over the Reals Responsable: Olivier Bournez, Professeur Ecole polytechnique, bournez@lix.polytechnique.fr, Thursday, from 8:45>11:45 Room 1004. Motivation and course objectives This course discusses computation (computability and complexity) theory for computations over real numbers.

c-2-34-1

Anonymous (anonymous@undisclosed.example.com) — 2024-12-03T07:16:30+00:00

Quantum information and applications (24h, 3ECTS) Person in charge: Sophie Laplante (Université Paris Cité, IRIF) Teachers for 2024-25 * Sophie Laplante (Université Paris Cité, IRIF) * Frédéric Magniez (CNRS, IRIF) Presentation and objectives Each year computing machines become faster and faster, but they use still use at their base the same Newtonian physics. Feynman in 1982 already asked about the necessity of this restriction to classical physics. The idea behind quantum computation …

c-2-34-2

Anonymous (anonymous@undisclosed.example.com) — 2025-02-04T13:54:20+00:00

Quantum Information and Cryptography (24h, 3ECTS) Lecturers Simon Apers André Chailloux Organization Tuesday 12h45-15h45 starting Dec. 10, Room 1004 Evaluation: Final exam. Prerequisites 2.34.1 Quantum computing or another course on quantum computing. Presentation and objectives The course will cover quantum information, quantum cryptography and advanced quantum algorithms.

c-2-35-1

Anonymous (anonymous@undisclosed.example.com) — 2017-09-01T11:53:58+00:00

Constraint Programming (24h, 3 ECTS) Teacher in charge: Sylvain Soliman (Inria) Goals The aim of this course is to introduce the concepts, principles and formalisms underlying constraint programming. The course will start from logical foundations and go up to recent extensions including concurrency and imperative features, while browsing through constraint logic programming and its applications to solving hard combinatorial problems.

c-2-36-1

Anonymous (anonymous@undisclosed.example.com) — 2024-12-10T14:32:14+00:00

Proof of Programs (24h, 3 ECTS) Teacher in charge: Jean-Marie Madiot (formerly Claude Marché) Teachers for 2024-2025: François Bobot, Jean-Marie Madiot Lessons will be given in French by default, in English upon request. The slides and the lecture notes will be in English. In the past 4 years, the course has been taught in English.

c-2-37-1

Anonymous (anonymous@undisclosed.example.com) — 2020-12-08T21:49:00+00:00

Programming shared memory multicore machines (24h, 3ECTS) Person in charge: Luc Maranget (INRIA) Follow the course in this virtual room. Teachers * Relexed Memory Concurrency (12h): Luc Maranget, notes de cours. * Runtime systems and task-parallel languages (12h): Adrien Guatto Warm-up Answers at the bottom of this page.

c-2-38-1

Anonymous (anonymous@undisclosed.example.com) — 2024-11-26T07:55:13+00:00

Algorithmique et combinatoire des graphes géométriques / Algorithms and combinatorics for geometric graphs (24h) Course 2-38-1, year 2024-2025. Teachers: Luca Castelli Aleardi (École Polytechnique) and Éric Colin de Verdière (CNRS & Université Gustave Eiffel). Other teachers not teaching this year:

c-2-39

Anonymous (anonymous@undisclosed.example.com) — 2024-04-23T06:49:09+00:00

Visual Data Analysis Datasaurus Dozen [Matejka et al. 2017] Lecturers * Jean-Daniel Fekete (INRIA) - jean-daniel.fekete@inria.fr * Julien Tierny (CNRS) - julien.tierny@sorbonne-universite.fr When? Where? * Friday, 4:15pm - 7:15pm * Room 1002 (Sophie Germain building) What's new? As of 2023, this class (previously dealing with graphics and visualization) is completely focused on visual data analysis.

c-2-40

Anonymous (anonymous@undisclosed.example.com) — 2024-10-11T08:40:10+00:00

Langages de Programmation Probabilistes (24h, 3 ECTS) Cours 2024 - 2025 * Responsable du cours: Christine Tasson * Intervenants: Guillaume Baudart, Xavier Rival, Christine Tasson * Le cours a lieu en première période le jeudi de 12h45 à 15h45 * English upon request Description

cours1

Anonymous (anonymous@undisclosed.example.com) — 2025-09-05T12:13:43+00:00

Level 1 modules Level 1 modules aim at (1) covering a large area of computer science research, and/or (2) giving a solid background for some theoretical and technical level 2 modules. A module takes place on a semester (resp. half a semester) and approximatively corresponds to 75 hours per student: 50 (resp. 25) hours of lessons and exercices and 25 (resp. 12.5) hours of personal works. It provides 7 (resp. 4) ECTS.

cours2

Anonymous (anonymous@undisclosed.example.com) — 2025-02-28T09:07:22+00:00

course_distribution

Anonymous (anonymous@undisclosed.example.com) — 2013-10-18T09:13:09+00:00

MPRI provides excellent coverage of the following themes in Computer Science: COCO = Computability and Complexity, ALGO = Algorithms, COCA = Combinatorics and Computer Algebra, CCSE = Cryptography, Coding, and Security, LSPR = Logics and Semantics of Programs, AUDE = Automated Deduction, AUFL = Automata and Formal Languages, SPAV = System Programming, Analysis, and Verification.

enseignants

Anonymous (anonymous@undisclosed.example.com) — 2018-09-13T18:39:21+00:00

Teaching staff The MPRI teaching staff is bound to vary from one year to the next: on the one hand, this depends on the modules selected by the MPRI's Executive Committee, and on the other hand, a same module may well include different contributors from year to year. The table herebelow contains a list of all the possible contributors mentioned for level 1 and level 2 modules on the MPRI Web site (except for some of the contributors teaching first year modules exclusively at the _École Polytech…

ethics

Anonymous (anonymous@undisclosed.example.com) — 2024-09-13T08:33:47+00:00

Ethics The rules of ethics that apply to all researchers also apply to all students of the M2 MPRI. In particular, plagiarism, whether during exams or during the internship, rigging results, failing to cite previous results, denigrating others, harassment, all are unacceptable behaviors. Please consult the French

listofmasters

Anonymous (anonymous@undisclosed.example.com) — 2015-06-23T13:41:05+00:00

A few relevant research masters in the Paris area (besides MPRI) You may, upon approval of your study director, include in your study plan courses from (for instance) the following masters and therefore validate up to 12 ECTS: * Master Ingénierie des Algorithmes et des Programmes, Univ. Paris Diderot * Master Logique mathematique et fondements de l'informatique, Univ. Paris Diderot * Master Mathématiques Fondamentales, Univ. Paris Diderot * Master Mathematiques Vision Apprentissage, U…

organisation

Anonymous (anonymous@undisclosed.example.com) — 2015-06-09T11:36:57+00:00

Organisation Year 1 (M1) The M1 year is organized independently by each partner institution. Year 2 (M2) M2 begins with a first semester dedicated to specialisation by way of level 2 advanced modules. The second semester is devoted to an introductory research internship with a French or foreign laboratory.

parcours

Anonymous (anonymous@undisclosed.example.com) — 2013-10-09T18:38:39+00:00

This page has not been updated since 2011. Several courses have been created or terminated since then. Les parcours types L'offre de formation est telle que le nombre de choix possibles de cours pour obtenir 30 ECTS pendant un semestre est très important. Il va de soi que pour des raisons d'organisation pratique, il ne sera pas possible de proposer tous les choix aux étudiants. Par ailleurs, il est indispensable que le choix des cours, et le parcours qui en résulte, soit scientifiquement et p…

sandbox

Anonymous (anonymous@undisclosed.example.com) — 2011-07-13T17:45:32+00:00

themes2013

Anonymous (anonymous@undisclosed.example.com) — 2015-04-13T16:52:35+00:00

Themes covered by the level 2 modules (this was last updated in 2013) MPRI provides excellent coverage of the following themes in Computer Science: COCO = Computability and Complexity, ALGO = Algorithms, COCA = Combinatorics and Computer Algebra,