PhD Defence • Programming Languages — C∀ Type System Implementation
Aaron Moss, PhD candidate
David R. Cheriton School of Computer Science
Aaron Moss, PhD candidate
David R. Cheriton School of Computer Science
Wei Yang, Master’s candidate
David R. Cheriton School of Computer Science
Kaiyu (Kevin) Wu, Master’s candidate
David R. Cheriton School of Computer Science
Haotian Zhang, PhD candidate
David R. Cheriton School of Computer Science
Adam Schunk, Master’s candidate
David R. Cheriton School of Computer Science
Nikita Volodin, Master’s candidate
David R. Cheriton School of Computer Science
John Wittnebel, Master’s candidate
David R. Cheriton School of Computer Science
In this thesis, we study lower bounds on maximum matchings in 1-planar graphs. We expand upon the tools used for proofs of matching bounds in other classes of graphs as well as some original ideas in order to find these bounds. The first novel results we provide are lower bounds of maximum matching in 1-planar graphs as a function of their minimum degree.
Jose Serna, Master’s candidate
David R. Cheriton School of Computer Science
Brandon Alcox, Master’s candidate
David R. Cheriton School of Computer Science
This thesis investigates the application of various fields of artificial intelligence to the domain of sports management and analysis. The research in this thesis is primarily focused on the entry draft for the National Hockey League, though many of the models proposed may be applied to other sports and leagues with minimal adjustments.
Anthony Anthony, Master’s candidate
David R. Cheriton School of Computer Science