CSE 361 Complexity of Sequential and Parallel Algorithms

 

Topics to be covered:

Preliminaries

Randomized Algorithms

Divide and Conquer, Sorting and Selection

Data Structures

Greedy Algorithms

Dynamic Programming

Graph Algorithms

Applied Algorithms

PRAM Algorithms

Mesh Algorithms

NP-hard and NP-complete Problems

Approximation Algorithms