D-405 (D-Block Seminar Room)
Hardness of Approximate Coloring
The Challenges in Verification of Concurrent Programs!
Blackwell's Approachability and Online Convex Optimization: Some New Relations
Paths to Stable Allocations
Fast and Efficient Algorithms for Sparse Recovery: A General Framework
Interactive Theorem Proving in Coq and the Curry-Howard Isomorphism
Optimality of Separation for Universal Communication With a Fidelity Criterion
Partitioning Problems, Submodular Functions and Approximating the OFDMA Capacity
Statistical Inference Based on a Parametric Family of Divergences
Pages
