CS 880 - Advanced Complexity Theory Spring 2006

Announcements

5/18:	The final grades have been posted. The grade distribution is as follow: A:6, AB:3, B:2. Thanks for taking the course and have a great summer!
4/20:	Here is the preliminary schedule for the project presentations: Date Room Topic Speaker(s) Thu 5/4, 3:00pm 4331 Uniform Hardness Amplification Jeff Kinne Mon 5/8, 1:30pm 3331 Expanders for Randomness-Efficient Sampling Bess Berg Tue 5/9, 1:30pm 4331 Pseudorandomness for Network Algorithms Siddharth Barman Tue 5/9, 3:00pm 4331 Extracting Randomness of States in Space Bounded Computations Anand Sinha Tue 5/9, 4:30pm 4331 The Computational Complexity of Expander Graphs Scott Diehl Mon 5/15, 10:30am 4331 Gabber-Galil Expanders Vinay Choudhary Mon 5/15, 1:30pm 4331 Electrical Properties of Expanders Mark Cowlishaw and Mike Kowalczyk Mon 5/15, 3:00pm 4331 Metric Embeddings Matthew Anderson and Prem Mansukhani Mon 5/15, 4:30pm 4331 Unique Locally Decodable Codes Jurgen Van Gael
11/17:	Welcome to CS 880! Please click on the "General Info" tab on the left to find out the information that is currently available about the Spring 2006 offering. More details will be added in due time. The first lecture will be Monday 1/23 in 2355 Engineering Hall. See you there!