Computational Complexity and other fun stuff in math and computer science from Lance Fortnow and Bill Gasarch
Tuesday, September 16, 2014
Maryland Theory Day October 10!
Univ of Maryland at College Park is having a Theory Day
Friday October 10.
Free Registration and Free Lunch! (there are no economists coming to tell us there is no such thing).
For Information and Registration goto here
A good way to learn lots of current theory in a short time.
8:30-9:00 Light Breakfast and Intro Remarks
9:00-9:20 Gasarch, UMCP
NIM with Cash
9:25-9:45 Mount, UMCP
A New Algorithm for Approximating the Euclidean Minimum Spanning Tree
9:50-10:10 Samir, UMCP:
To do or not to do: scheduling to minimize energy
10:20-11:00 Coffee Break
11:00-12:00 Distinguished Invited Speaker Avrim Blum, CMU
Reconstructing preferences and priorities from opaque transactions
12:00-1:00 Catered Lunch
1:00-2:00 Distinguished Invited Speaker Sanjeev Arora, Princeton
Overcoming the intractability bottleneck in unsupervised learning.
2:00-2:30 Coffee Break
2:30-2:50 Elaine Shi, UMCP
Circuit ORAM and Tightness of the Goldreich-Ostrovksy bound
2:55-3:15 David Harris, UMCP
The Moser-Tardos Framework with Partial Resampling
3:20-3:40 Mohammad Hajiaghayi, UMCP
Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond
3:45-4:05 Michael Dinitz, JHU
Explicit Expanding Expanders
4:10-5:00 Poster Session in 2120 (Grad Students)
Post a Comment