BATS 2005

	BATS: Bay Area Theory Symposium 2005
Information	This year's Bay Area Theory Symposium (BATS) will be held at Stanford University on Friday, November 18, 2005. All talks will be held in the CIS building (Allen Center for Integrated Systems), room 101.
Program	10.30 . 11.00	Coffee and pastries
	11.00 . 12.00	Miklos Ajtai, IBM Almaden The role of lattices in complexity theory and cryptography
	12.00 . 12.30	Shuchi Chawla, Stanford University Approximation Algorithms for Planning Problems
	12.30 . 2.00	Lunch (provided)
	2.00 . 3.00	Michael Luby, Digital Fountain Application-layer FEC codes for mobile wireless broadcast and multicast services
	3.00 . 3.30	Constantinos Daskalakis, UC Berkeley The Complexity of Nash Equilibria
	3.30 . 4.00	Coffee
	4.00 . 4.30	Jason Hartline, Microsoft Mechanism Design via Machine Learning
	4.30 . 5.00	Vladlen Koltun, Stanford University The Arrangement Method for Linear Programming
	5.00 . 6.00	Satish Rao, UC Berkeley Recent progress on Sparsest Cuts and Metric Embeddings

Directions	Directions to the Gates Building (CS Dept) are here. The talks are in the nearby CIS building (see map).
Parking	For non-Stanford attendees, a limited number of "A" parking permits will be avilable from Dan Boneh and Tim Roughgarden on the morning of the conference (first-come, first-serve). Please make an effort to carpool so that we have enough permits for everybody. There is a large parking struture near the Gates building; see the "Directions" link above.
Organizers	Dan Boneh (Stanford), Steve Chien (Microsoft), Robi Krauthgamer (IBM), Tim Roughgarden (Stanford), Alistair Sinclair (Berkeley)
Contact	For additional information, please contact Dan Boneh (dabo at cs.stanford.edu) or Tim Roughgarden (tim at cs.stanford.edu).