Seminar

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

Mohammadali Niknamian, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Ihab Ilyas

Please note: This PhD seminar will be given online.

Nathan Harms, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Eric Blais

Please note: This seminar will be given online.

Mennatallah El-Assady, Research Associate
Data Analysis and Visualization, University of Konstanz
Visualization for Information Analysis Lab, University of Ontario Institute of Technology

Please note: This seminar will be given online.

Grace Liu, Postdoctoral Researcher
Cylab, Carnegie Mellon University

Please note: This seminar will be given online.

Pei Wu, Computer Science Department
University of California, Los Angeles

We prove that for every decision tree, the absolute values of the Fourier coefficients of given order $\ell\geq1$ sum to at most $c^{\ell}\sqrt{\binom{d}{\ell}(1+\log n)^{\ell-1}},$ where $n$ is the number of variables, $d$ is the tree depth, and $c>0$ is an absolute constant. This bound is essentially tight and settles a conjecture due to Tal (arxiv 2019; FOCS 2020). 

Please note: This PhD seminar will be given online.

Alister Liao, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Peter van Beek

Please note: This seminar will be given online.

Marios Kogias, Researcher
Microsoft Research, Cambridge

Please note: This seminar will be given online.

Sadjad Fouladi, Computer Science Department
Stanford University

Please note: This seminar will be given online.

Danfei Xu, Computer Science Department
Stanford University

Please note: This PhD seminar will be given online.

Jessy Ceha, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Edith Law