Selected Invited Talks

Analytic techniques in Theoretical Computer Science

BIRS, Oaxaca 2018

Explicit Binary Tree Codes with Polylogarithmic Size Alphabet

Computer Science and Discrete Mathematics Seminar

IAS 2018

Explicit Binary Tree Codes with Polylogarithmic Size Alphabet

video

Harvard Theory of Computing Seminar

Harvard 2018

Hitting Sets with Near-Optimal Error for Read-Once Branching Programs

slides

Columbia Theory Seminar

Columbia University 2018

Hitting Sets with Near-Optimal Error for Read-Once Branching Programs

slides

Computational Complexity of Discrete Problems

Dagstuhl 2017

Recent Advances in Randomness Extractors and Their Applications

group photo

a funnier photo

Workshop on Expanders and Extractors

Simons Institute, Berkeley 2017

Correlation Breakers, Independence-Preserving Mergers, and their Applications

video

Algebraic Methods in Computational Complexity

Dagstuhl 2016

Regretfully declined due to time conflict with FOCS

Computer Science and Discrete Mathematics Seminar

IAS 2016

Algebraic geometric codes and their applications

video

Workshop on Computational Complexity

BIRS, Banff 2016

Recent Advances in Non-Malleable Extractors and Applications

video

group photo

DIMACS Workshop on Cryptography and its Interactions

Rutgers University 2016

Recent Advances in Non-Malleable Extractors and Privacy Amplification Protocols

slides

Caltech-UCLA Joint Analysis Seminar

Caltech 2016

Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs

Complexity Theory Conference

Oberwolfach 2015

Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs

group photo

Computer Science and Discrete Mathematics Seminar

IAS 2015

Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs

video part 1 (one hour slides)

video part 2 (two hours board)

Computer Science and Discrete Mathematics Seminar

IAS 2013

Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball

video

Israel Mathematical Union Meeting

Bar-Ilan University 2012

Non-Malleable Extractors with Short Seeds and Applications to Privacy Amplification

slides

China Theory Week

Aarhus University 2012

Non-Malleable Extractors with Short Seeds and Applications to Privacy Amplification

A Day Seminar on Extractors and Privacy Amplication

CWI Amsterdam 2011

Non-Malleable Extractors with Short Seeds and Applications to Privacy Amplification