Current students

Please note: This PhD seminar will take place online.

Xinyu Shi, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Jian Zhao

Please note: This master’s thesis presentation will take place in DC 1304 and virtually.

Benjamin Thérien, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Krzysztof Czarnecki

Please note: This seminar will take place in DC 1302.

Roswitha Rissner, Department of Mathematics
Alpen-Adria-Universität Klagenfurt, Austria

Given a square matrix B' over a (commutative) ring S, the null ideal N_0(B') is the ideal consisting of all polynomials f in S[X] for which f(B')=0. In the case that S=R/J is the residue class ring of a ring R modulo an ideal J, we can equivalently study the so-called J-ideals

N_J(B) =  { f in  R[X]  |  f(B) in M_n(J) }

Please note: This PhD defence will take place in DC 1331.

Aida Sheshbolouki, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor M. Tamer Özsu

Please note: This PhD seminar will take place online.

Charupriya Sharma, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Peter van Beek

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

Anupa Murali, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Bin Ma

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

Odunayo Ogundepo, Master’s candidate
David. R. Cheriton School of Computer Science

Supervisor: Professor Jimmy Lin

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

Niki Hasrati, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Shai Ben-David

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

Daewoo Kim, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Trevor Brown

Memory management in multicore systems is a well studied area. Many approaches to memory management have been developed and tuned with specific hardware architectures in mind, capitalizing on hardware characteristics to improve performance. In this thesis, the focus is on memory allocation and reclamation in multicore systems.

Please note: This master’s thesis presentation will take place in DC 3317.

Matt D’Souza, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Ondřej Lhoták

Parametric polymorphism, also known as generics, is an abstraction that lets programmers define code that behaves independently of the types of values it operates on. Generics is a useful abstraction to enable code reuse and improve the maintainability of software projects.