Subscribe to:
Post Comments (Atom)
skip to main |
skip to sidebar
Schedule
- Jan. 28: Deterministic algorithms for the Lovász Local Lemma (Shiva)
- Feb. 4: On the power of randomization in algorithmic mechanism design (Aaron)
- Feb. 11: Twice-Ramanujan sparsifiers (Richard)
- Feb. 18: Higher eigenvalues of graphs (Zed)
- Feb. 25: An O(log n / log log n)-approximation algorithm for the asymmetric traveling salesman problem (Ravi)
- Mar. 4: Intrinsic robustness of the price of anarchy (Or)
- Mar. 11: Spring Break, no class
- Mar. 18: Composition of low-error 2-query PCPs using decodable PCPs (Ali)
- Mar. 25: 3-query locally decodable codes of subexponential length (Sarah)
- Apr. 1: Fully homomorphic encryption using ideal lattices (Yi)
- Apr. 8: Poly-logarithmic independence fools AC^0 circuits (Yuan)
- Apr. 15: Regularity lemmas and combinatorial algorithms (Srivatsan)
- Apr. 22: The intersection of two halfpsaces has high threshold degree (Pranjal)
- Apr. 29: Tight bounds for clock synchronization (Harsha)
Blog Archive
Labels
- Announcement (1)
Posts
No comments:
Post a Comment