Events

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:

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

Kamyar Ghajar, Master’s candidate
David R. Cheriton School of Computer Science

Supervisors: Professors Mark Smucker, Charles Clarke

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

Ajiromola Kola-Olawuyi, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Mei Nagappan

This study focuses on factors that may significantly influence the outcomes of CI builds triggered by commits modifying and/or adding DevOps artefacts to the projects, i.e., DevOps-related CI builds. In particular, code ownership of DevOps artefacts is one such factor that could impact DevOps-related CI builds.

Please note: This PhD seminar will take place in DC 2310 and online.

Jesse Elliott, PhD candidate
David R. Cheriton School of Computer Science

Supervisors: Professors David Jao, Éric Schost

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

Abdallah Elshamy, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Samer Al-Kiswany

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

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.