Theory of Combinatorial Algorithms Institute for Theoretical Computer Science Department of Computer Science ETH Zurich

Reading Seminar Fall 2008

 

Time & Place

Fridays 16:15-18:00 (note the change of time), CAB H57.
 

Organizers

Uli Wagner, CAB G33.2, Tel: 044 632 73 39, .
Emo Welzl, CAB G15.2, Tel: 044 632 73 70, .
 

Course Description

We study recent and not-so-recent papers in combinatorics and theoretical computer science.
 

Preliminary Schedule of Talks


Date Speaker Article

3.10.2008Dominik Scheder Jeff Kahn, Michael Saks, and Dean Sturtevant. A topological approach to evasiveness.

31.10.2008Yves Brise Constantinos Daskalakis, Paul W. Goldberg, and Christos H. Papadimitriou. The complexity of computing a Nash equilibrium.

21.11.2008Tobias Christ and Andreas Razen Neil Robertson, Paul Seymour, and Robin Thomas. Sachs' linkless embedding conjecture. Part 1.

28.11.2008Tobias Christ and Andreas Razen Neil Robertson, Paul Seymour, and Robin Thomas. Sachs' linkless embedding conjecture. Part 2.

5.12.2008Robin Moser Dimitris Achlioptas and Amin Coja-Oghlan. Algorithmic Barriers from Phase Transitions.

Last modified: 12.12.2008 by Uli Wagner.
Valid HTML 4.0!
Valid CSS!