Maryland Theory Day 2012

UMIACS, the University of Maryland Institute for Advanced Computer Studies, is delighted to organize the Maryland Theory Day on October 24, 2012, one day after the FOCS conference. We anticipate a lively day of talks and disussions on a range of topics including approximation algorithms, coding theory, combinatorial games and optimization, complexity theory, cryptography, fixed-parameter tractability, geometry, privacy, and randomized algorithms.

Schedule:

8:30-9: Light breakfast
9-10: Distinguished Invited Speaker: Prof. Julia Chuzhoy, Toyota Technological Institute
10-10:20: Prof. David Mount: Polytope Approximation and the Mahler Volume
10:25-11:00: Coffee Break
11:00-12:10: Three short talks with three-minute gaps:

11:00-11:20: Prof. Jonathan Katz: Completely Fair Protocols for Secure Computation
11:25-11:45: Prof. Samir Khuller: Combinatorial Algorithms for Online Structured Prediction
11:50-12:10: Prof. MohammadTaghi Hajiaghayi: Minimizing Movement: Approximability and Fixed Parameter Tractability

12:10-1:30: Lunch (on your own; a light snack will be provided)
1:30-2:30: Distinguished Invited Speaker: Prof. Venkatesan Guruswami, Carnegie-Mellon University
2:30-3:00: Coffee Break
3:00-4:10: Three short talks with three-minute gaps:

3:00-3:20: Prof. Elaine Shi: Oblivious Storage Made Simple
3:25-3:45: Prof. Bill Gasarch: The Complexity of Grid Problems
3:50-4:10: Prof. Aravind Srinivasan: Constraint Satisfaction and the Lovász Local Lemma

4:10-5:00: Poster session with reception in A.V. Williams 2120

Abstracts: Please click here.

Logistics:

Venue: Room 2460, A. V. Williams Building, University of Maryland at College Park
Date and time: October 24, 2012, 8:30AM-5PM
Registration: free and required by October 10, 2012: please email umdtheory12 AT gmail (with a .com after the gmail) with your name, institution, and email address.

Contact: For logistical questions, please contact Edna Walker (edna AT umiacs.umd.edu); for other questions, please contact Aravind Srinivasan (srin AT cs.umd.edu).