Events - 2023

Please note: This PhD defence will take place online.

Joshua Jung, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Jesse Hoey

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.

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 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 PhD seminar will take place in DC 2310 and online.

Pablo Millán Arias, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Lila Kari

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

Luis Fernando Lins dos Santos, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Paulo Alencar

Please note: This PhD defence will take place in DC 2314 and online.

Johra Muhammad Moosa, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Bin Ma

Please note: This seminar will take place in M3 4206 and online.

Rachel Yun Zhang, PhD student
CSAIL, Massachusetts Institute of Technology

A code, which is a set of strings called codewords, is locally testable if one can test whether a given word is close to a codeword by reading only a few bits. Locally testable codes have been studied since the 1990s as key ingredients in the construction of probabilistically checkable proofs.

Please note: This seminar will take place in MC 5501 and online.

Mika Göös, Assistant Professor
Theory Group, École polytechnique fédérale de Lausanne

We present a top-down lower-bound method for depth-4 Boolean circuits. In particular, we give a new proof of the well-known result that the parity function requires depth-4 circuits of size exponential in n^{1/3}. Our proof is an application of robust sunflowers and block unpredictability.

Joint with Artur Riazanov, Anastasia Sofronova, and Dmitry Sokolov.

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

Han Zhao, Assistant Professor
Computer Science, University of Illinois Urbana-Champaign
Amazon Visiting Academic, Amazon AI and Search Science

To mitigate the bias exhibited by machine learning models, fairness criteria can be integrated into the training process to ensure fair treatment across all demographics, but it often comes at the expense of model performance. Understanding such tradeoffs, therefore, underlies the design of optimal and fair algorithms.

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

Farshad Kazemi, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Shane McIntosh

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

Marina Meila
Department of Statistics, University of Washington
Senior Fellow, University of Washington’s eScience Institute