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
- Nov. 14, 2018Waterloo programmers top the competition, earn spot in International Collegiate Programming Competition World Finals
Four teams of programmers from the University of Waterloo swept the top spots at an Association for Computing Machinery regional International Collegiate Programming Competition over the weekend.
- Nov. 13, 2018Research Professor Maura Grossman member of panel discussing responsible AI
The following is excerpted from an article by Craig Daniels, published in Communitech News on November 8, 2018
Governments, educators and private companies all must act quickly to rein in the biases and excesses of autonomous systems driven by powerful artificial intelligence, a lunchtime symposium at CIGI heard Wednesday. The price of not acting is an existential threat to the fabric of human society.
- Nov. 12, 2018Ali Abedi and Mohammad Mazaheri win first prize at ACM MobiCom 2018
Ali Abedi and Mohammad Mazaheri won first place at the ACM Student Research Competition at MobiCom 2018, the 24thACM Annual International Conference on Mobile Computing and Networking.
Events
- Nov. 21, 2018PhD Seminar • Data Systems — Distributed Dependency Discovery
Hemant Saxena, PhD candidate
David R. Cheriton School of Computer ScienceWe address the problem of discovering dependencies from distributed big data. Existing (non-distributed) algorithms focus on minimizing computation by pruning the search space of possible dependencies. However, distributed algorithms must also optimize data communication costs, especially in current shared-nothing settings.
- Nov. 21, 2018PhD Seminar • Algorithms and Complexity — Revisiting the Simulation of Quantum Turing Machines by Quantum Circuits
Abel Molina, PhD candidate
David R. Cheriton School of Computer ScienceYao (1993) proved that quantum Turing machines and uniformly generated quantum circuits are polynomially equivalent computational models: t >= n steps of a quantum Turing machine running on an input of length n can be simulated by a uniformly generated family of quantum circuits with size quadratic in t, and a polynomial-time uniformly generated family of quantum circuits can be simulated by a quantum Turing machine running in polynomial time.
- Nov. 23, 2018Seminar • Systems and Networking — SpecRPC: A General Framework for Performing Speculative Remote Procedure Calls
Xinan Yan, PhD candidate
David R. Cheriton School of Computer Science
