Classes

COT 5405: Graduate Algorithms

Semester: 
Fall
Offered: 
2015

This course explores advanced algorithms for problem solving in the real world. Emphasis is provided on extending known results by employing computational thinking to solve new problems. Formal techniques for proving correctness and analyzing the performance of algorithms will also be discussed. Hardness results, approximation and randomized algorithms will also be briefly surveyed in the course.

    Graduate Computational Complexity

    Semester: 
    Spring
    Offered: 
    2015

    The class provides a gentle introduction to models of computation and their use in understanding the complexity of algorithms. Non-traditional models of computation and parallel complexity will be a particular focus of the Spring 2015 edition of this class.

    Graduate Algorithms

    Offered: 
    2014

    This course explores advanced algorithms for problem solving in the real world. Emphasis is provided on extending known results by employing computational thinking to solve new problems. Formal techniques for proving correctness and analyzing the performance of algorithms will also be discussed. Hardness results, approximation and randomized algorithms will also be briefly surveyed in the course.

    Computational Modeling

    Semester: 
    Spring
    Offered: 
    2013

    The course will focus on algorithmic techniques for analysis and validation of computational models. We will also survey recent advances in the area of computational models, with a particular focus on design, parameter estimation, composition, and automated synthesis. At the end of this course, the student should be able to design, validate and analyze new computational models from data and expert specifications.