PhD Defence • Algorithms and Complexity • Testing, Learning, Sampling, Sketching
Please note: This PhD defence will be take place online.
Nathan Harms, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Eric Blais
Nathan Harms, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Eric Blais
Ege Ciklabakkal, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Toshiya Hachisuka
Mohammad Dehghan, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Lukasz Golab
Text simplification is a task in the natural language processing field that alters a given text to reduce the structural and lexical complexity of the text while preserving the underlying meaning.
Joseph Musleh, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Éric Schost
Anurag Murty Naredla, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Anna Lubiw
In the dispersion problem for ordered intervals, the input is an ordered list of intervals on the real line, and the task is to select one point from each interval, such that the ordering of points along the line respects the given ordering of intervals and such that the points are “far apart” from each other.
Thierry Delisle, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Peter Buhr
Solaiappan Alagappan, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Maura R. Grossman
Yuqi Liu, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Jimmy Lin
Brian Zimmerman, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Olga Vechtomova
Hung Viet Pham, PhD candidate
David R. Cheriton School of Computer Science
Supervisors: Professors Lin Tan, Yaoliang Yu