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

Specialization: Data Science Foundations: Data Structures and Algorithms Instructor: Sriram Sankaranarayanan, Assistant Professor Prior knowledge needed: We highly recommended successfully completing ...

This course examines such topics as greedy algorithms, dynamic programming, graph algorithms, string processing, and algorithms for computational geometry. We will discuss how to use these techniques ...

A new technique for efficient encoding of LDPC codes based on the known concept of Approximate Lower Triangulation (ALT) is introduced. The greedy permutation algorithm is presented to transform ...