Capital Area Theory Seminar

Fall 2014

Date Time Location Speaker Title
Sep 19 1:00-2:00 PM CSIC3120 Kanthi Kiran Sarpatwar Approximation Algorithms for Container Selection Problems.
Sep 26 11:00-12:00 PM CSIC2117 Kurt Mehlhorn Certifying Computations: Algorithmics meets Software Engineering
Oct 3 1:00-2:00 PM CSIC3120 Manish Purohit Elementary Properties of Geometric Objects in High Dimensions
Oct 10 8:30-5:00 PM CSIC2460 Assorted Speakers Maryland Theory Day
Oct 17 1:00-2:00 PM CSIC3120 Amit Chavan Random Graphs
Oct 24 1:00-2:00 PM CSIC3120 Thomas Pensyl An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization
Oct 30 2:00-3:00 PM AVW4172 Grigory Yaroslavtsev Parallel Algorithms for Geometric Graph Problems
Nov 7 1:00-2:00 PM CSIC3120 Brendan Lucier Non-Bayesian Learning in Sparse and Expansive Networks
Nov 14 1:00-2:00 PM CSIC3120 Guy Kortsarz The Interesting Behavior of the Source Location Problem.
Nov 21 1:00-2:00 PM CSIC3120 [TBA] TBA
Dec 5 1:00-2:00 PM CSIC3120 Julian Shun A Framework for Processing Large Graphs in Shared Memory
Dec 12 1:00-2:00 PM CSIC3120 [TBA] TBA
Dec 19 1:00-2:00 PM CSIC3120 [TBA] TBA

(*) 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.

CATS Talks from previous semesters