Algorithms 2022/23

This course is part of the ACSAI program at Sapienza University of Rome.

Teacher

Prof. Flavio Chierichetti

Classes

• Wednesday 11:00 – 14:00

• Thursday 12:00 – 14:00

Useful Links

• Please subscribe to our mailing list (using your institutional email address ...@studenti.uniroma1.it) to receive lecture notes and to get news about the course.

Textbooks

• Algorithm Design, Kleinberg, Tardos

• Introduction to Algorithms, Cormen, Leiserson, Rivest, Stein

Syllabus

1. February 22nd: Introduction to Algorithms

2. February 23rd: Matching

3. March 1st: Stable Matching

4. March 2nd: Running Times, Big-Oh Notation

5. March 8th: Arrays, Doubly Linked Lists, and Efficiency

6. March 9th: Greedy Algorithms, and Interval Scheduling

7. March 15th: Interval Partitioning

8. March 16th: Graphs

9. March 22nd: Dijkstra's Algorithm (1)

10. March 23rd: Heaps (1)

11. March 29th: Heaps (2)

12. March 30th: Dijkstra's Algorithm (2)

13. April 5th: Dynamic Programming

14. April 12th: Weighted Interval Scheduling

15. April 13th: Subset-Sum

16. April 19th: Bellman-Ford

17. April 20th: MergeSort

18. April 26th: Recurrences

19. April 27th: Integer Multiplication

20. May 3rd: Reductions and NP-completeness

21. May 5th: Vertex Cover