Open Topic in Algorithms and Complexity
Project Description
In this project, the student will choose one of the modern topics in algorithms and complexity, e.g. parameterized, approximate, distributed or randomized algorithms, and read a series of books and papers on it. The student will also be required to develop their coding abilities at the level of international algorithmic/programming competitions. Finally, after obtaining this required background, the student will choose a topic of interest in modern algorithmics and contribute to state-of-the-art research. The project is likely to span over more than one year and the students should consider this when choosing this UROP.
Supervisor
KAFSHDAR GOHARSHADY, Amir
Quota
7
Course type
UROP1000
UROP1100
UROP2100
UROP3100
UROP3200
UROP4100
Applicant's Roles
See the description above.
Applicant's Learning Objectives
By the end of the UROP, the student should be a competitive candidate for MPhil/PhD positions in theoretical computer science with a broad background of the field and some deep research experience.
Complexity of the project
Challenging