Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Friday, May 15, 2009, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Nathan Linial (Hebrew Univ. of Jerusalem, Israel)

Topology meets the probabilistic method

The probabilistic method has revolutionized modern combinatorics. Can this revolution be exported to other areas? An interesting possibility is to investigate topological structures from the perspective of the probabilistic method. In this talk I will discuss several recent papers where we attempt to do this. We are considering (i) Simplicial complexes and (ii) Curves on 2-dimensional manifolds.

The works I will discuss are joint with Roy Meshulam, Tah Nowik, Mishael Rosenthal and Lior Aronshtam.

The talk is self-contained and requires no particular background in topology.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login