Current students

Please note: This master’s research paper presentation will take place in DC 2310.

Gan Wang, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Martin Karsten

The emergence of 5G technology is transforming telecommunications, granting people and industry remarkable capabilities. With research advancements, in the future we could see 5G offer speeds of up to 20 gigabits per second, far surpassing 4G’s capabilities. This speed not only enables lightning-fast downloads, its low latency, as low as 1 millisecond, is ideal for real-time applications like remote surgery and augmented or virtual reality. 

Please note: This master’s thesis presentation will take place online.

Ru Ji, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Meng Xu

Computer scientists at the Cheriton School of Computer Science are using a graph-based deep learning model to analyze proteins on the surface of cells, which could lead to personalized medicine to treat cancer and infectious diseases.  

The researchers developed GraphNovo, a new program that provides a more accurate understanding of cellular peptide sequences, linear chains of amino acids.

Immunotherapy is a powerful new way to treat cancer, harnessing the body’s natural defences to find and kill cancer cells.

By applying machine learning, researchers at the Cheriton School of Computer Science are working to strengthen this mechanism, making it possible to develop personalized cancer-fighting drugs.

Wednesday, December 20, 2023 11:00 am - 12:00 pm EST (GMT -05:00)

Master’s Thesis Presentation • Algorithms and Complexity • Compact Routing on Planar Graphs

Please note: This master’s thesis presentation will take place online.

Newsha Seyedi, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Ian Munro

This thesis delves into the exploration of shortest path queries in planar graphs, with an emphasis on the utilization of space-efficient data structures. Our investigation primarily targets connected, undirected, static pointer planar graphs, focusing on scenarios where queries predominantly start or end at a select subset of nodes.