CSc 80040

 Spring 2012

 Practical considerations for the design of efficient algorithms
Thursdays, 2:00 - 4:00 pm
- 3 credits - Professor Gabor T. Herman

This course discusses recently published algorithms in various application areas that have been demonstrated to be effcient in practice. In the process the student will be introduced to notions such as nondeterministic algorithms, heuristic procedures, parallel implementations, and statistical validation of claims of algorithmic performance. Student performance will be evaluated based on two computer projects to be handed in half way and at the end of the course, respectively.

Course Materials:

Part I :
    Documents and papers (~10MB)     tar.gz     zip     
        (updated Feb. 15, 2012, added/modified files course_topics.pdf and Nikazad&Davidi.pdf )
        (updated Mar. 3, 2012, added/modified files Chen&Herman.pdf to Course Topics - same as in Part III )
        (updated Mar. 26, 2012, added/modified files Censor&Chen.pdf to Course Topics - same as in Part III )

    Snark09Experiments (~90MB)     tar.gz     zip     (same as original)

Part II (~ 3Mb):     tar.gz     zip     
        (updated Feb. 15, 2012, added/modified files Nikazad&Davidi.pdf )
        (updated Feb. 21, 2012, added/modified files Superiorization_project.pdf )

Part III (~ 2Mb):     tar.gz     zip     
        (updated Mar. 3, 2012, added/modified files Chen&Herman.pdf )
        (updated Mar. 26, 2012, added/modified files Censor&Chen.pdf )

Part IV (~ 20Mb):     tar.gz     zip     

Part V (~ 0.5Mb):     tar.gz     zip