The 65th Midwest Theory Day will take place at Purdue University
on Saturday, May 3rd, 2014.
We are inviting anyone interested in theoretical Computer Science to attend the Spring edition of the Midwest Theory Day at Purdue University, on May 3rd.
The event is a biannual tradition among the CS theorists in the Midwest, aiming to be an opportunity for us to meet each other, share our research, and initiate collaborations.
Please find out more about previous MTDs here .
Registration is free, but you must register to participate. We will provide break snacks and lunch.
11:00-12:00 Chris Peikert (Invited Speaker) Georgia Tech. "Cryptography from Rings".
1:00-1:30 Shi Li, TTI-C. "Better Algorithms and Hardness for Broadcast Scheduling via a
1:30-2:00 Danny Chen, Notre Dame. "Stories of Clustering, in Applications and Theory"
2:30-2:50 Shashank Agrawal, UIUC. "Explicit Non-Malleable Codes Resistant to Permutations"
2:50-3:10 Vivek Madan UIUC. "Centrality of Trees for Capacitated k-Center"
3:10-3:30 Jeremy Kun, UIC. "Resilient Coloring and Other Combinatorial Problems"
4:00-4:20 Sam Taggart, Northwestern University. "The Approximate Optimality of Simple Auctions"
4:20-4:40 Peng Zhang, Purdue. "Optimal Query Complexity for Estimating the Trace of a Matrix"
4:40-5:00 Erfan Sadeqi Azer, IU. "Palindrome Recognition in the Streaming Model"
Please plan to arrive between 10-10:30 am EDT. Talks will begin at 11 am and the official part of the meeting will end around 5pm. For those staying for dinner more info will become available later.
The event will take place at
3102A/B Lawson Computer Science Building,
305 N. University Ave.
West Lafayette, IN 47907
Parking is free on weekends and there is a garage right across from Lawson @ 3rd St and N University Street.
We are planning on starting registration around 10am to give people who are driving from nearby location enough time to get here. We're aiming to have the talks between 11am and 5pm.
Some information on hotels and directions can be found here.