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 ...

Algorithm design strategies such as divide and conquer. Elementary techniques for analysis; asymptotic analysis ... establishing algorithmic correctness and estimating time and space complexity.

These fundamentals include complexity theory to determine the inherent limits of computation and communication and cryptography and the design and analysis of algorithms to obtain optimal solutions ...

The design, implementation, and analysis of abstract data types, data structures and their algorithms. Topics include: data and procedural abstraction, amortized data structures, trees and search ...

We will learn how to analyze the complexity of the randomized quicksort/quickselect algorithms. We will learn open address hashing: a technique that simplifies hashtable design. Next we will study the ...

"The complexity of the graph isomorphism problem ... "Our work does not aim to design algorithms optimized for superior worst ...