Such algorithms are often quite efficient and provide useful bounds on the optimal solutions. The learning will be supported by instructor provided notes, readings from textbooks and assignments.

Cross-listed with DTSA 5503. Course Type: Pathway | Breadth Specialization: Foundations of Data Structures and Algorithms Instructor: Dr. Sriram Sankaranarayanan, Professor of Computer Science Prior ...

This course covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP ...

Jeremy Johnson: Computer algebra, design and analysis of algorithms, programming languages and compilers, automated performance tuning, algorithms for DSP, parallel processing, and high-performance ...