Events tagged with Staff

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

Ihab Ilyas
Professor, Cheriton School of Computer Science
NSERC-Thomson Reuters Research Chair on Data Quality
Distinguished Engineer, Apple

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

Akira Yoshiyama, Undergraduate computer science student
David R. Cheriton School of Computer Science

Mentor: Lena Podina

Please note: This PhD seminar will take place online.

Kira Selby, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Pascal Poupart

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

Gustavo Sutter Pessurno de Carvalho, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Pascal Poupart

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

Faisal Nawab, Assistant Professor
Department of Computer Science, University of California, Irvine
Director, EdgeLab

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

Luyun Lin, 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.

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 master’s thesis presentation will take place online.

Ru Ji, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Meng Xu

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.