Thesis defence

Please note: This master’s thesis presentation will be given online.

Kilby Baron, Master’s candidate
David R. Cheriton School of Computer Science

Supervisors: Professors Mike Godfrey and Mei Nagappan

Please note: This PhD defence will be given online.

Alexandra Vtyurina, PhD candidate
David R. Cheriton School of Computer Science

Supervisors: Professors Charles Clarke and Edith Law

Please note: This master’s thesis presentation will be given online.

Linqing Liu, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Jimmy Lin

Please note: This master’s thesis presentation will be given online.

Zhengkun Chen, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Eric Blais

We establish a directed analogue of Chung and Tetali’s isoperimetric inequality for graph products. We use this inequality to obtain new bounds on the query complexity for testing monotonicity of Boolean-valued functions over products of general posets.