Theory of Computation Seminars

Fully Dynamic Connectivity in O(log n(log log n)^2) Amortized Expected Time

Quantum hashing is maximally secure against classical leakage

Cake Cutting: Fairness and Efficiency

Lower bounds for estimating matching size in streaming models

Pseudorandomness of Ring-LWE for Any Ring and Modulus

Core sets and streaming algorithms for MAX CUT

Generalization and Equilibrium in Generative Adversarial Nets (GANs)

Instance Optimal Learning

Distributed Exact Weighted All-Pairs Shortest Paths

Planar Graph Perfect Matching is in NC

Bayesian estimation from few samples: community detection and related problems

Consistency Thresholds for the Planted Bisection Model

Efficient Massively Parallel Methods for Dynamic Programming

Secure delegation of quantum computation