Instructor: M. Mavronicolas A. Philippou
  Room: FST 01-106 FST 01-105
  Telephone: 22-892702 22-892699
Back to Main Page Class Pages Class Notes Books Related Links



Topics in the design and analysis of efficient algorithms and their complexity. Significant algorithms in Graph Theory, Algebra, Geometry, Number Theory and Combinatorics. General algorithmic techniques (e.g., divide-and-conquer, backtracking, dynamic programming). Randomized algorithms. Advanced topics, Fast Fourier Transform, sorting networks, Parallel Algorithms, Inherent (lower) bounds on problem complexity.



CS 231: Data Structures and Algorithms