Mittagsseminar (in cooperation with J. Lengler, A. Steger, and D. Steurer)
Talks by Christoph Ambühl
1998
August
- August 27, 1998, Christoph Ambühl: Towards New Lower Bounds for the List Update Problem [details]
November
- November 10, 1998, Christoph Ambühl: The Random Assignment Problem [details]
1999
February
- February 02, 1999, Christoph Ambühl: Karp's Upper Bound on the Expected Cost of an Optimal Assignment [details]
May
- May 06, 1999, Christoph Ambühl: Burrows-Wheeler transformations [details]
October
- October 19, 1999, Christoph Ambühl: Optimal projective list update algorithms (I) [details]
- October 26, 1999, Christoph Ambühl: Optimal projective list update algorithms (II) [details]
2000
April
- April 06, 2000, Christoph Ambühl: Offline list update is NP-hard [details]
- April 11, 2000, Christoph Ambühl: Offline list update is NP-hard [details]
May
- May 09, 2000, Christoph Ambühl: Offline list is NP-hard (II) [details]
November
- November 21, 2000, Christoph Ambühl: Fast Broadcastin and Gossiping in Radio Networks - Marek Chrobak, Leszek Gasieniec, Wojciech Rytter (FOCS 2000) [details]
2001
June
- June 07, 2001, Christoph Ambühl: Mean Payoff Games [details]
2002
April
- Friday, April 19, 2002, Christoph Ambühl: Call Control in Rings (joint work with Udo Adamy, R. Sai Anand, and Thomas Erlebach) [details]
2005
February
- February 10, 2005, Christoph Ambühl (Istituto Dalle Molle di Studi sull' Intelligenza Artificiale, Lugano): Minimum spanning trees in the unit disk [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
