Mittagsseminar (in cooperation with J. Lengler, A. Steger, and D. Steurer)

Talks by Jerri Nummenpalo

2015

April

• April 16, 2015, Jerri Nummenpalo: Extension Complexity of Polytopes - Some Recent Advances [details]

September

• September 10, 2015, in CAB G61, Jerri Nummenpalo: Efficient computation of middle levels Gray codes [details]

2016

June

• June 16, 2016, Jerri Nummenpalo: Constant time algorithm for middle levels Gray codes [details]

2017

February

• February 28, 2017, Jerri Nummenpalo: Finding One of Many Needles in a Haystack: Searching and Sampling SAT [details]

December

• December 12, 2017, Jerri Nummenpalo: Sparse Kneser graphs are Hamiltonian [details]

2018

November

• November 01, 2018, Jerri Nummenpalo: A simple proof of the middle levels theorem [details]

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

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