Information for

Welcome to the David R. Cheriton School of Computer Science

The Cheriton School of Computer Science is named for David R. Cheriton, who earned his PhD in Computer Science in 1978, and made a transformational gift to the school in 2005. It has become the largest academic concentration of Computer Science researchers in Canada.  

Discover our latest achievements by following our news and events.
Please go to contact, open positions or visit if you have a question about school programs or services, would like to know more about faculty positions available or plan to visit our school.
  1. July 11, 2018Hustle to success — The unlikely entrepreneurphoto of Bill Gates and Sam Pasupalak

    Cheriton School of Computer Science graduate Sam Pasupalak with Bill Gates, Co-Founder of Microsoft.

  2. July 10, 2018Computer science researchers help answer an age-old medical science questionphoto of Dr. Baranoski and Spencer van Leeuwen

    by Rose Simone

    Why do our veins look blue when blood is red? This is a seemingly elementary science trivia question, and certainly not one that computer science researchers would be expected to be interested in.

  3. July 9, 2018Motivating gamers with personalized game designGames Institute logo

    A team of multidisciplinary researchers at the University of Waterloo has identified three basic video game player traits that will help to make game design more personalized and more effectively motivate gamers in both entertainment and work applications.

Read all news
  1. July 18, 2018PhD Seminar • Data Systems — Experimental Analysis of Streaming Algorithms for Graph Partitioning

    Anil Pacaci, PhD candidate
    David R. Cheriton School of Computer Science

  2. July 18, 2018Seminar • Algorithms and Complexity— Additive Number Theory via Approximation by Regular Languages

    Finn Lidbetter, Master’s candidate
    David R. Cheriton School of Computer Science

    The fundamental problem of additive number theory is to determine whether there exists an integer m such that every nonnegative integer (resp., every sufficiently large nonnegative integer) is the sum of at most m elements of S. If so, we call S an additive basis of order m (resp., an asymptotic additive basis of order m). If such an m exists, we also want to find the smallest such m.

  3. July 20, 2018PhD Seminar • Bioinformatics Group — TwitSong: The Evolution of a Poetry Generator

    Carolyn Lamb, PhD candidate
    David R. Cheriton School of Computer Science

    We describe three versions of TwitSong, a system that generates poetry based on the news. TwitSong is designed to make aesthetic decisions about potential lines of poetry and, in the third version, to edit its own work. We describe how the system was developed, how it performs in user studies, and why this type of computer-generated poetry still has a long way to go.

All upcoming events