Past talks

Contents



2017/11/29: Jon Kelner (MIT)

posted Nov 30, 2017, 5:34 AM by Alice Bob

Almost-Linear-Time Algorithms for Markov Chains and New Spectral Primitives for Directed Graphs

2017/11/15: Vinod Vaikuntanathan (MIT)

posted Nov 15, 2017, 4:21 PM by Alice Bob

Program Obfuscation and Random CSPs: The Love-Hate Relationship


2017/11/08: Ola Svensson (EPFL)

posted Nov 8, 2017, 11:49 AM by Alice Bob

A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem


2017/10/25: Seth Pettie (University of Michigan)

posted Oct 25, 2017, 11:39 AM by Alice Bob   [ updated Oct 25, 2017, 11:58 AM ]

A Time Hierarchy Theorem for the LOCAL Model


2017/10/11: Moses Charikar (Stanford)

posted Oct 22, 2017, 11:49 AM by Alice Bob   [ updated Oct 22, 2017, 11:54 AM ]

Hashing-based-Estimators for Kernel Density in High Dimensions


2017/09/27: Yuval Peres (Microsoft Research)

posted Oct 22, 2017, 11:46 AM by Alice Bob   [ updated Oct 22, 2017, 11:52 AM ]

Trace reconstruction for the deletion channel


2017/06/07: Erik Waingarten (Columbia University)

posted Jul 19, 2017, 2:17 PM by Gautam Kamath   [ updated Jul 19, 2017, 8:36 PM ]

Settling the query complexity of non-adaptive junta testing

2017/05/24: Mohsen Ghaffari (ETH Zurich)

posted Jul 19, 2017, 2:15 PM by Gautam Kamath

On the Complexity of Local Distributed Graph Problems

2017/05/10: Avishay Tal (IAS)

posted Jul 19, 2017, 2:12 PM by Gautam Kamath   [ updated Jul 19, 2017, 2:38 PM ]

Computing Requires Larger Formulas than Approximating

2017/04/26: Santosh Vempala (Georgia Tech)

posted Jul 19, 2017, 12:26 PM by Gautam Kamath

Sampling Polytopes: From Euclid to Riemann

1-10 of 79