Please note: This PhD seminar will be given online.
Charupriya Sharma, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Peter van Beek
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 seminar will be given online.
Marios Kogias, Researcher
Microsoft Research, Cambridge
Please note: This PhD seminar will be given online.
Jessy Ceha, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Edith Law
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 Distinguished Lecture Series presentation will be given online.
Leonard Kleinrock
Distinguished Professor of Computer Science
University of California, Los Angeles
