Eric Fleury's Web Pages



 Brief Curriculum Vitae

 Research Interests



   Algo II



 Open Positions

 Professional Activities



Algo II: advanced algorithms

L3 / Department of computer science / ENS Lyon

Teaching staffs & schedule


Date Topic TD Reading
CM-01, January, 31 General introduction / Data structure I:

Binary Heap, Priority Queue

Binary Search Tree

TD01 CLRS/Chapter 10: Elementary Data Structure;

CLRS/Chapter 12: Binary Search Tree;

Revision CLRS/Chapter 17: Amortized Analysis;

Revision CLRS/Chapter 21: Union Find

CM-02, February, 7 Data structure II:

Balanced Trees, AVL

TD02 CLRS/Chapter 19 (binomial heap in CLRS second edition)

note sur hauteur moyenne d'un ABR

CM-03, February, 14 Data structure III:

Binomial Heaps, Fibonacci Heaps

QCM -- 20 min --

Home Work number 1, due date is 2018/02/28

CLRS/Chapter 13 & CLRS/Chapter 11
February, 21 Vacation on Week nunber 8
CM-04, February, 28 Data structure IV:

Red Black Tree

Augmenting Data Structure

Hash Table

Deadline for the Home Work I !

CLRS/Chapter 14
CM-05, March, 7 Graph I:

Data structures

BFS, DSF, Application

CLRS/Chapter 22
CM-06, March 14 Graph II:

Connected Components, DAG

CLRS/Chapter 22
CM-07, March 21 Graph III:


CLRS/Chapter 23
CM-08, March 28 Graph IV:

Shortest Paths

CLRS/Chapter 24 & 25
CM-09, April 4 Graph V: Coupling
CM-10, April 11 Graph VI: Maximum Flow CLRS/Chapter 26
CM-11, April 18 Mid Term EXAM

Useful documents


  • Thomas Cormen, Charles Leiserson, Ronald Rivest, Clifford Stein: Introduction to algorithms. MIT Press, 2001
  • Algorithm Design by Jon Kleinberg and va Tardos. Addison-Wesley, 2005.
  • Algorithms 4/e by Robert Sedgewick and Kevin Wayne. Addison-Wesley Professional, 2011.
  • Introduction to Graph Theory by Douglas West. Pearson Modern.

Copyright © 2009 DANTE Team - INRIA
Last modified: Mar 6 fev 2018 17:32:23 CET