Click here to register or email to RSVP.
9:00 am Breakfast
9:20 am Introduction, Zvi Galil, John P. Imlay Jr. Dean of Computing
9:30 am Learning submodular Functions, Nina Balcan, Computer Science
10:00 am How Bad Guys Use Theory Against Us, Wenke Lee, Computer Science
10:30 am New bounds for the hardcore model on the square lattice, Prasad Tetali, Mathematics
11:00 am Coffee Break
11:15 am Distinguished Lecture: Deletion without Rebalancing in Balanced Search Trees, Robert Tarjan, James S. McDonnell Distinguished University Professor of Computer Science, Princeton University
12:30 pm Lunch
The following posters by ARC fellowship winners for 2010-2011 will be on display throughout the event:
- Efficient Cryptographic Pseudorandom Generators. Abhishek Banerjee
- Complexity of Cutting Plane Methods for Random Integer Programs. Karthekeyan Chandrasekaran
- A Dynamical Systems Model of Price Bubbles. Vinod Cheriyan
- Sell or Hold: A simple two-stage stochastic combinatorial optimization problem. Qie He
- Towards a spectral algorithm for graph multi-partitioning. Anand Louis
- Plug-in Approach to Active Learning. Stas Minsker
- Spatial mixing: Refinements and Applications. Ricardo Restrepo
- A new set of invariants for graphs - a Torelli type problem. Farbod Shokrieh
- Tensors and Random Constraint Satisfaction. Ying Xiao
- Analysis of the Hard-core Model on Square Lattices beyond the Tree Uniqueness Threshold. Linji Yang
- In Campus Calendar
-
No
- Groups
-
College of Computing, School of Computer Science
- Invited Audience
-
No audiences were selected.
- Categories
-
No categories were selected.
- Keywords
-
ARC4
- Status
-
- Created By: Louise Russo
- Workflow Status: Published
- Created On: Mar 4, 2011 - 1:22pm
- Last Updated: Oct 7, 2016 - 9:54pm
