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

Reading Seminar 2007

Time & Place

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


Tibor Szabó,CAB G31.2,Tel: 044 632 08 58,
Uli Wagner,CAB G33.2,Tel: 044 632 73 39,.
Emo Welzl,CAB G15.2,Tel: 044 632 73 70,

Course Description

Training is everything. The peach was once a bitter almond; cauliflower is nothing but cabbage with a college education. - Mark Twain

Schedule of Presentations

Date Speaker Article

05.10.2007Uli Wagner Leonid Gurvits. Hyperbolic polynomials approach to Van der Waerden/
Schrijver-Valiant like conjectures

12.10.2007Uli Wagner Continuation of last week's talk.

26.10.2007Dominik Scheder Omer Reingold. Undirected ST-Connectivity in LOG-Space

02.11.2007Marek Sulovský Alexander Schrijver. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time

09.11.2007Tibor Szabó Noga Alon. Explicit Ramsey graphs and orthonormal labelings

16.11.2007Andreas Razen Timothy Gowers. Quasirandom Groups

23.11.2007Yves Brise Henry Cohn, Robert Kleinberg, Balazs Szegedy, and Christopher Umans. Group-theoretic algorithms for matrix multiplication

07.12.2007Philipp Zumstein Jacob Fox and Benny Sudakov. Induced Ramsey-Type Theorems

14.12.2007Tobias Christ Sanjeev Arora, Satish Rao, and Umesh Vazirani. Expander Flows, Geometric Embeddings and Graph Partitioning

Last modified: $Date: 2007/10/04$ by Uli Wagner. Valid HTML 4.0! Valid CSS!