|
 |
|
|
|
|
|
Reading Seminar Spring 2009
Time & Place
Fridays 15:15-17:00, CAB G56.
Organizers
.
.Course Description
We study recent papers in combinatorics and theoretical computer science.
Preliminary Schedule of Talks
| | |||||
| Date | Speaker | Article | |||
| | |||||
| 6.3.2009 | Dominik Scheder | Johan Hastad. Some optimal inapproximability results | |||
| | |||||
| 8.5.2009 | Robin Moser | Mark Braverman. Poly-logarithmic independence fools AC0 circuits | |||
| | |||||
| 15.5.2009 | Nathan Linial | Nati will give a guest lecture Topology meets the probabilistic method (here is a short abstract). | |||
| | |||||
Last modified: 13.5.2009 by Uli Wagner.
