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.
News
- May 17, 2019Jesse Hoey and Robert Freeland receive 2019 Outstanding Recent Contribution in Social Psychology Award
Cheriton School of Computer Science Professor Jesse Hoey has teamed up with Professor Robert Freeland, a sociologist at Wake Forest University, to conduct novel research at the intersection of computer science and social psychology.
- May 13, 2019Chang Ge, Ihab Ilyas, Xi He and Ashwin Machanavajjhala develop new system that offers protection against data breaches
Cheriton School of Computer Science PhD candidate Chang Ge, Professors Ihab Ilyas and Xi He, and their colleague Professor Ashwin Machanavajjhala at Duke University
- May 2, 2019Speeding up a blockchain to meet real-world speeds and needs
Blockchain technology creates digital ledgers that record sequential exchanges of information, commonly called transactions. To improve performance, transactions are batched into blocks before they are added to the ledger. Each new block contains a hash value which, like a mugshot, acts as an identifier and proof of the previous state of the ledger.
Events
- May 21, 2019Master’s Thesis Presentation • Data Systems — Entity Matching and Disambiguation Across Multiple Knowledge Graphs
Michael Farag, Master’s candidate
David R. Cheriton School of Computer Science - May 21, 2019PhD Seminar • Software Engineering — CRADLE: Cross-Backend Validation to Detect and Localize Bugs in Deep Learning Libraries
Hung Viet Pham, PhD candidate
David R. Cheriton School of Computer Science - May 22, 2019Seminar • Algorithms and Complexity — The Combinatorics of Furthest and Nearest Values
Lily Wang, University of Waterloo
A classical problem asks us to find, for each element $A[i]$ of an array of integers, the position of the nearest smallest element. Similarly, we can ask about the dual problem: for each element of an array of integers $A[i]$, what is the position of the furthest smaller element?
