# Events

## Filter by:

Friday, April 9, 2021 1:30 pm - 1:30 pm EDT (GMT -04:00)

## DLS: Laurie Williams — Solving Software Security Challenges with Artificial Intelligence

Laurie Williams
Distinguished University Professor
Department of Computer Science, North Carolina State University

Monday, April 12, 2021 11:00 am - 11:00 am EDT (GMT -04:00)

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

David R. Cheriton School of Computer Science

Supervisor: Professor Lukasz Golab

Monday, April 12, 2021 12:00 pm - 12:00 pm EDT (GMT -04:00)

## Please note: This seminar will be given online.

Danfei Xu, Computer Science Department
Stanford University

Tuesday, April 13, 2021 12:00 pm - 12:00 pm EDT (GMT -04:00)

## Please note: This seminar will be given online.

Stanford University

Tuesday, April 13, 2021 3:00 pm - 3:00 pm EDT (GMT -04:00)

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

Clara Kang, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Craig Kaplan

Symmetric patterns are used widely in clothing manufacture. However, the discontinuity of patterns at seams can disrupt the visual appeal of clothing. While it is possible to align patterns to conceal such pattern breaks, it is hard to create a completely seamless garment in terms of pattern continuity.

Wednesday, April 14, 2021 11:00 am - 11:00 am EDT (GMT -04:00)

## 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

Wednesday, April 14, 2021 1:00 pm - 1:00 pm EDT (GMT -04:00)

## 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).

Thursday, April 15, 2021 12:00 pm - 12:00 pm EDT (GMT -04:00)

## Please note: This seminar will be given online.

Marios Kogias, Researcher
Microsoft Research, Cambridge

Thursday, April 15, 2021 2:00 pm - 2:00 pm EDT (GMT -04:00)

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

Sreeharsha Udayashankar, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Samer Al-Kiswany

Friday, April 16, 2021 1:00 pm - 1:00 pm EDT (GMT -04:00)

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

Alexander Van de Kleut, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Jeff Orchard