Video Lectures

I will continue the exposition of different derandmization techniques for probabilistic logspace algorithms.
The material of this talk will assume only little knowledge from the first talk.

Since the foundational results of Thomason and Chung-Graham-Wilson on quasirandom graphs over 20 years ago, there has been a lot of effort by many researchers to extend the theory to hypergraphs. I will present some of this history, and then...

In 1985 Misha Gromov proved his Nonsqueezing Theorem, and hence constructed the first symplectic 1-capacity. In 1989 Helmut Hofer asked whether symplectic d-capacities exist if 1 d n. I will discuss the answer to this question and its relevance in...

The trace formula has been the most powerful and mainstream tool in automorphic forms for proving instances of Langlands functoriality, including character relations. Its generalization, the relative trace formula, has also been used to prove...

I will survey some of the basic approaches to derandomizing Probabilistic Logspace computations, including the "classical" Nisan, Impagliazzo-Nisan-Widgerson and Reingold-Raz generators, the Saks-Zhou algorithm and some more recent approaches. We'll...

Fundamental questions in basic and applied ecology alike involve complex adaptive systems, in which localized interactions among individual agents give rise to emergent patterns that feed back to affect individual behavior. In such systems, a...

Polar codes have recently emerged as a new class of low-complexity codes achieving Shannon capacity. This talk introduces polar codes with emphasis on the probabilistic phenomenon underlying the code construction. New results and connections to...