Past talks

Contents



2016/05/25: Eric Blais (Waterloo)

posted May 25, 2016, 2:03 PM by Gautam Kamath   [ updated May 25, 2016, 5:20 PM ]

A Polynomial Lower Bound for Testing Monotonicity

2016/05/11: Ankit Garg (Princeton University)

posted May 25, 2016, 1:58 PM by Gautam Kamath   [ updated May 25, 2016, 2:04 PM ]

Operator Scaling and Applications to Non-Commutative Rational Identity Testing

2016/04/27: Omer Reingold (Samsung Research America)

posted Apr 27, 2016, 10:34 PM by Gautam Kamath

Constant Round Interactive Proofs for Delegating Computation

2016/04/13: Stephen Fenner (University of South Carolina)

posted Apr 13, 2016, 3:27 PM by Gautam Kamath

Bipartite Perfect Matching is in Quasi-NC

2016/03/30: Ran Raz (Weizmann Institute and IAS)

posted Mar 30, 2016, 10:37 AM by Gautam Kamath   [ updated Mar 30, 2016, 11:59 AM ]

Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity Learning

2016/03/16: Tali Kaufman (Bar-Ilan University)

posted Mar 19, 2016, 1:18 PM by Alice Bob-Eve

Bounded Degree High Dimensional Expanders

2016/03/02: Ola Svensson (EPFL)

posted Mar 14, 2016, 8:55 AM by Gautam Kamath   [ updated Mar 14, 2016, 8:56 AM ]

Lift-and-Round to Improve Scheduling on Unrelated Machines

2016/02/17: Ronitt Rubinfeld (MIT)

posted Feb 17, 2016, 4:01 PM by Gautam Kamath

Local Computation Algorithms

2016/02/03: Ilya Razenshteyn (MIT)

posted Feb 3, 2016, 3:24 PM by Gautam Kamath   [ updated Feb 3, 2016, 3:24 PM ]

Sketching and Embedding are Equivalent for Norms

2016/01/20: Scott Aaronson (MIT)

posted Jan 20, 2016, 2:06 PM by Gautam Kamath

The Largest Possible Quantum Speedups

1-10 of 57