Please note: This master’s thesis presentation will be given online.
Yangtian Zi, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Gregor Richards
Please note: This master’s thesis presentation will be given online.
Cameron Seth, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Eric Blais
The GapDensest-k-Subgraph(d) problem (GapDkS(d)) is defined as follows: given a graph G and parameters k,d, distinguish between the case that G contains a k-clique, and the case that every k-subgraph of G has density at most d.
Please note: This master’s thesis presentation will be given online.
Gaetano Coccimiglio, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Trevor Brown
Please note: This master’s thesis presentation will be given online.
Anubhav Srivastava, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Trevor Brown
The ordered dictionary is one of the most fundamental abstract data types. It stores a set of key-value pairs, and supports operations to insert, remove and retrieve key-value pairs. It can also support range query operations.
Please note: This PhD defence will be given online.
Xinan Yan, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Bernard Wong
