Algorithms

• Basic algorithmic methods:

  • Divide and Conquer: PPTX
  • Greedy Algorithms: PPTX
  • Dynamic programming: PPTX

• Graphs algorithms:

  • Graphs recap: PPTX
  • Minimal spanning tree: PPTX
  • Shortest paths from signle source: PPTX
  • Shortest paths between all the vertices: PPTX
  • Max-flow - Min-cut algorithm: PPTX

• Polynoms and FFT

Cormen T.H., Leiserson C.E., Rivest R.L., Stein C, Introduction to Algorithms, Third Edition, The MIT Press, 2009 מבוא לאלגוריתמים, האוניברסיטה הפתוחה, 2008 (תרגום 18 הפרקים הראשונים של הספר הקודם) ספרים נוספים: Sedgewick R., Flajolet P., An Introduction to the Analysis of Algorithms, Addison-Wesley, 1996 Knuth D., Art of Computer Programming, Volumes 1-4, Addison-Wesley, 2005 Sedgewick R., Wayne K., Algorithms , Addison-Wesley, 4th edition, 2011.

Lecture slides for Algorithm Design: https://www.cs.princeton.edu/~wayne/kleinberg-tardos/

Introduction to Artificial Intelligence: https://courses.cs.washington.edu/courses/cse473/12sp/

Optimization problems: Simulated anealing: https://nathanrooy.github.io/posts/2020-05-14/simulated-annealing-with-python/

Course "Digital Visual Effects", Spring 2021 by Yung-Yu Chuang https://www.csie.ntu.edu.tw/~cyy/courses/vfx/21spring/lectures/