Seminar

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

Akira Yoshiyama, Undergraduate computer science student
David R. Cheriton School of Computer Science

Mentor: Lena Podina

Please note: This PhD seminar will take place online.

Kira Selby, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Pascal Poupart

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

Faisal Nawab, Assistant Professor
Department of Computer Science, University of California, Irvine
Director, EdgeLab

Please note: This PhD seminar will take place online.

Aref Jafari, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Ali Ghodsi

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

Ihab Ilyas
Professor, Cheriton School of Computer Science
NSERC-Thomson Reuters Research Chair on Data Quality
Distinguished Engineer, Apple

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

Ehsan Ganjidoost, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Jeff Orchard

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.