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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, April 20, 2006, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Dominik Scheder

Fourier Analysis in Computer Science and Combinatorics (Part II)

We will define Fourier Transformation of boolean functions on the discrete cube {0,1}^n. We will introduce the notion of "influence" of a variable on a boolean function, which has a nice representation in terms of the Fourier coefficients of the function.

We then sketch the prove of the KKL theorem (a central result about influences) and then show how this implies the sharp threshold theorem for monotone graph properties.


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

Previous talks by year:   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