Theory Seminars

Scalable Sparse Approximation of a Sample Mean

For-all Sparse Recovery in Near-Optimal Time

Learning with Noisy Labels

General truthfulness characterizations via convex analysis

Modal Analysis with Compressive Measurements

Better Approximation Algorithms for Graph Diameter

Pricing, Market Making, Scoring Rules, and Exponential Families

What can a bit tell us? Forays into information scalability.

Theory Seminar Introduction

Coding, Complexity, and Sparsity Workshop

Coding, Complexity, and Sparsity Workshop

Coding, Complexity, and Sparsity Workshop

Byzantine Agreement in Polynomial Expected Time

Dynamic Graph Connectivity in Polylogarithmic Worst Case Time

What gaussian processes can do for you: applications of probability and geometry in theoretical computer science

High-degree graphs cannot be used for a quantum PCP

Every locally characterized affine-invariant property is testable

Recent Progress on Parallel Repetition

Sketching For Big Data Recommender Systems Using Fast Pseudo-Random Fingerprints

Distributed Oblivious RAM for Secure Two-Party Computation

On the Decodability of Primitive Reed-Solomon Codes

One algorithm to rule them all: One join query at a time

Characterizing Strategic Cascades on Networks

The Locality of Distributed Symmetry Breaking