CATS-Spring-2015

From Theory
Revision as of 23:51, 31 August 2015 by Karthikabinav (talk | contribs) (→‎CATS Talks from previous semesters)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Capital Area Theory Seminar[edit]

Spring 2015[edit]

Date Time Location Speaker Title
Jan 21 1:00-2:00 PM CSIC3120 Katarzyna Paluch Maximum ATSP with Weights Zero and One via Half-Edges
Jan 22 11:00-12:00 PM CSIC3118 Howard Karloff Variable Selection is Hard
Feb 6 1:00-2:00 PM CSIC3120 Neal Gupta Foundations of Clustering
Feb 13 2:30-3:30 PM AVW3258 Manish Purohit Vertex Connectivity under Sampling
Feb 19 11:00-12:00 PM AVW4172 Dana Moshkovitz Hard Problems in Hardness of Approximation: Sharp Thresholds, Parallel Repetition and Unique Games
Feb 20 11:00-12:00 PM CSI3117 Scott Aaronson Exploring the limits of the Efficiently Computable
Feb 27 1:00-2:00 PM CSI3120 Karthik Abinav Sankararaman Spectral Sparsification
Apr 3 1:00-2:00 PM CSI3120 Brian Brubach Space-efficient Local Computation Algorithms
Apr 10 1:00-2:00 PM CSIC3120 Blair Sullivan Models to Motifs: A Graph Structure Success Story
Apr 24 1:00-2:00 PM CSIC3120 Ahmed Abdelkader Convexity, Colors, LP and PPAD
Apr 30 1:00-2:00 PM AVW4172 David Woodruff Sketching as a Tool for Numerical Linear Algebra
May 8 3:00-4:00 PM CSIC3117 Constantinos Daskalakis Computing on Strategic Inputs

(*) Sponsored by CS Dept and Northrop Grumman.

(**) Supported in part by NSF CAREER award 1053605, NSF grant CCF-1161626, ONR YIP award N000141110662, DARPA/AFOSR grant FA9550-12-1-0423, and a grant from Simons Foundation.