Complexity theory is a branch of computer science that studies the resources required to solve computational problems, particularly focusing on the classification of problems based on their inherent ...

The 30th Annual European Symposium on Algorithms awarded its 2021 Test-of-Time Award to Sorin Istrail, professor of computational and mathematical sciences and professor of computer science, and his ...

*Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.

New research from the University of Waterloo is making inroads on one of the biggest problems in theoretical computer science ...

The Foundations of Data Structures and Algorithms specialization includes two optional preparation courses and a three-course pathway to earn admission to the Online MS in Computer Science. You must ...

Complexity theory is a fundamental branch of theoretical computer science that categorises computational problems according to their inherent difficulty and the resources required to solve them. At ...