| ||||||
| ||||||
Seminars | ||||||
| ||||||
| Two Weeks starting on October 4, 2009 | ||||||
|
|
|
|
||||||||||||||||||||||||||||||||||||||||
| ||||||||||||||||||||||||||||||||||||||||||
|
Thursday, October 8, 2009 |
|||
|
|
Oct 8 |
4:15 p.m. - 5:45 p.m. |
CS 201: A Collection of [Mostly] Mathematical Puzzles, SPEAKER: RICHARD KORF, UCLA
|
|
|
|||
|
Monday, October 12, 2009 |
|||
|
|
Oct 12 |
|
Columbus Day
|
|
|
|||
|
Tuesday, October 13, 2009 |
|||
|
|
Oct 13 |
4:15 p.m. - 5:45 p.m. |
CS 201: Resolving the Computational Complexity of Universal Hashing, SPEAKER: AMIT SAHAI, UCLA
|
|
|
|||
|
Thursday, October 15, 2009 |
|||
|
|
Oct 15 |
4:15 p.m. - 5:45 p.m. |
CS 201: Immortal DB: A Strong Case for Transaction Time Database Systems, SPEAKER: DAVID LOMET, Microsoft Research
|