Events

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:

Please note: This master’s thesis presentation will take place in DC 2310 and online.

Gengyi Sun, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Shane McIntosh

Monday, November 27, 2023 12:00 pm - 1:00 pm EST (GMT -05:00)

Seminar • Algorithms and Complexity • Top-Down Lower Bounds for Depth-Four Circuits

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.

Please note: This PhD seminar will take place in E5 4047.

Murray Dunne, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Sebastian Fischmeister

Please note: This PhD defence will take place in DC 2314 and online.

Johra Muhammad Moosa, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Bin Ma

Wednesday, November 29, 2023 12:00 pm - 1:00 pm EST (GMT -05:00)

Seminar • Algorithms and Complexity • New Codes on High Dimensional Expanders

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 master’s thesis presentation will take place in DC 3317.

Luis Fernando Lins dos Santos, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Paulo Alencar