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. Dec. 11, 2018Cheriton School of Computer Science researchers study catastrophic effects network failures have on cloud-computing systemsphoto of Hatem Takruri, Ahmed Alquraan, Mohammed Alfatafta and Samer Al-Kiswany

    Computer clusters power everything from Google and Facebook to online retail and banking. They’re comprised of hundreds or even thousands of machines connected together by networks, typically in a vast data centre. 

  2. Dec. 3, 2018Professor Shai Ben-David and colleagues win best paper award at NeurIPS 2018photo of Professor Shai Ben-David

    Cheriton School of Computer Science Professor Shai Ben-David, his former PhD student Hassan Ashtiani, now an Assistant Professor at McMaster University, along with colleagues Christopher Liaw, Abbas Mehrabian and Yaniv Plan, have received a best paper award at NeurIPS 2018, the 32ndAnnual Conference on Neural Information Processing Systems.

  3. Nov. 30, 2018Professor Shai Ben-David and colleagues prove that some problems in statistical machine learning cannot be resolvedphoto of Professor Shai Ben-David

    One of the most important results in logic is Kurt Gödel’s work from 1931 that proved that some questions in mathematics cannot be resolved — that mathematics has limits.

Read all news
  1. Dec. 12, 2018PhD Seminar • Data Systems — GAL: Graph-Aware Layout for Disk-Resident Graph Databases

    Zeynep Korkmaz, PhD seminar
    David R. Cheriton School of Computer Science

    Analysis on graphs have powerful impact on solving many social and scientific problems, and applications often perform expensive traversals on large scale graphs. Caching approaches on top of persistent storage are among the classical solutions to handle high request throughput. However, graph processing applications have poor access locality, and caching algorithms do not improve disk I/O sufficiently.

  2. Dec. 12, 2018Master’s Thesis Presentation • Algorithms and Complexity — Counting, Adding, and Regular Languages

    Thomas Lidbetter, Master candidate
    David R. Cheriton School of Computer Science

    In this talk we consider two mostly disjoint topics in formal language theory that both involve the study and use of regular languages. The first topic lies in the intersection of automata theory and additive number theory. 

  3. Dec. 13, 2018PhD Seminar • Data Systems —Dynamic Sampling used in TREC Core 2018

    Haotian Zhang, PhD candidate
    David R. Cheriton School of Computer Science

All upcoming events