Course Description This course is part three of a specialization on algorithms and data structures. It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and ...

CS 336 or Permission of Instructor Description This is an advanced undergraduate course on algorithms. This course examines such topics as greedy algorithms, dynamic programming, graph algorithms, ...

Researchers have applied space–time tiling techniques to the classic Nussinov algorithm, achieving notable improvements in parallel performance and scalability on multi-core architectures [1].

Algorithm design and analysis is fundamental to all areas of computer science and gives a rigorous framework for the study optimization. This course provides an introduction to algorithm design ...