Computer Science and Engineering

CSE 290A Topics in Algorithms and Complexity Theory: Probabilistic Algorithms and Average Case Analysis

Graduate seminar in algorithms and complexity theory on topics from recently published research journal articles and conference proceedings. Topics vary from year to year depending on the current research of the instructor(s) and interests of students. Students read technical papers from relevant journals and conference proceedings and present class lectures. Guest lectures may supplement the student presentations. A research project and/or paper may be required. (Formerly Computer Science 290A.)

Requirements

Enrollment is restricted to graduate students.

Credits

5

Quarter offered

Fall

Instructor

The Staff, Seshadhri Comandur, Evangelos Chatziafratis

Repeatable for credit

Yes