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

Reading Seminar Spring 2008

 

Time & Place

Fridays 15:15-17:00, CAB G56.
 

Organizers

Tibor Szabó, CAB G31.2, Tel: 044 632 08 58, lastname@inf.ethz.ch.
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 papers in combinatorics and theoretical computer science.
 

Preliminary Schedule of Talks


Date Speaker Article

14.3.2008Heidi Gebauer Vladimir Nikiforov. The number of cliques in graphs of given order and size

21.3.2008Easter break.

28.3.2008Easter break.

4.4.2008Tibor Szabó Sum-product estimates, extractors, and bipartite Ramsey-graphs

11.4.2008Martin Jaggi Noga Alon and Assaf Naor. Approximating the cut norm using Grothendieck's inequality.

18.4.2008Andreas Razen László Lovász and Balázs Szegedy. Szemerédi's lemma for the analyst.

25.4.2008Uli Wagner Nathan Linial and Roy Meshulam. Homological connectivity of random 2-complexes.

2.5.2008Marek Sulovský The Colin de Verdière graph parameter

9.5.2008 NO SEMINAR (Robert's defense)

16.5.2008Robin Moser László Lovász and Balázs Szegedy. Limits of dense graph sequences.

23.5.2008Philipp Zumstein David Conlon. A new upper bound for diagonal Ramsey numbers

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