Computer science doctoral student Yuhao Dong, master’s student Woojung Kim, along with their supervisor Professor Raouf Boutaba, have received the best student paper award at Blockchain-2018, the 2018 IEEE International Conference on Blockchain.
Professor Kevin Harrigan, Director of the Knowledge Translation Stream at Waterloo's Gambling Research Lab, and Professor Dan Brown, Director of the David R. Cheriton School of Computer Science, are determined to figure out the best way to educate players about the addictive properties of slot machines and how much money they might win or lose.
Carolyn Lamb, PhD candidate
David R. Cheriton School of Computer Science
This thesis is driven by the question of how computers can generate poetry, and how that poetry can be evaluated. We survey existing work on computer-generated poetry and interdisciplinary work on how to evaluate this type of computer-generated creative product.
by Ivana Kajić, WiCS member and PhD student in computer science at the University of Waterloo, working in the Computational Neuroscience Research Group
Programming can help students achieve more in their studies and allow faculty and staff to make light of repetitive and routine tasks, but many shy away from programming because learning to code can seem daunting.
Ifaz Kabir, Master’s candidate
David R. Cheriton School of Computer Science
Steven Wang, Master’s candidate
David R. Cheriton School of Computer Science
The 2018 International Olympiad in Informatics (IOI), held this year in Tsukuba, Japan, is an annual competitive programming competition for secondary school students and consists of two days of computer programming and algorithmic problem-solving.
Joey Yu, a graduate of Thornhill Secondary School and now a first-year student in the David R. Cheriton School of Computer Science, finished 26th in the gruelling contest, earning a gold medal.
One often-heard complaint is that academics labour away in their ivory towers, divorced from happenings in the real world. A few years ago, Professor Semih Salihoglu of the Data Systems Group at the University of Waterloo's Cheriton School of Computer Science noticed exactly this for graph processing.
Yossef Musleh, Master’s candidate
David R. Cheriton School of Computer Science
We introduce a Monte Carlo randomized algorithm for computing the characteristic polynomial of a rank 2 Drinfeld module than runs in $O(n^2 \log n \log \log n \log q)$ field operations. We also introduce a deterministic algorithm that runs in $O(n^{2.6258} \log n + n^2 \log n \log log n \log q)$ field operations. Both approaches are a significant improvement over the current literature.