Talks by Michael Hoffmann1997
October
- October 21, 1997, Michael Hoffmann: Searching in Monotone Matrices [details]
1999
January
- January 07, 1999, Michael Hoffmann: Path Coupling: A technique for proving rapid mixing in Markov chains (Part II) [details]
February
- February 23, 1999, Michael Hoffmann: Counting with uniform generators [details]
April
- April 08, 1999, Michael Hoffmann: The rectangular 3-center problem [details]
2000
May
- May 16, 2000, Michael Hoffmann: Pushing boxes is hard, even for infinite strength robots [details]
December
- December 12, 2000, Michael Hoffmann: More pushing blocks [details]
2001
July
- July 10, 2001, Michael Hoffmann: An Adaptable and and Extensible Geometry Kernel [details]
October
- October 23, 2001, Michael Hoffmann: Segment Endpoint Visibility Graphs are Hamiltonian [details]
2002
March
- March 12, 2002, Michael Hoffmann: Alternating paths among disjoint line segments [details]
May
- May 28, 2002, Michael Hoffmann: PushPush [details]
2003
March
- March 13, 2003, Michael Hoffmann: Semi-Dynamic Planar Convex Hull [details]
November
- November 25, 2003, Michael Hoffmann: Pointed Encompassing Trees [details]
2004
April
- April 20, 2004, Michael Hoffmann (University of Leicester): Efficient Update Strategies for Geometric Computing with Uncertainty [details]
September
- September 28, 2004, Michael Hoffmann: Chordless Paths and Cycles [details]
2005
March
- March 31, 2005, Michael Hoffmann: Degree Bounds for Constrained Pseudo-Triangulations [details]
2006
December
- December 12, 2006, Michael Hoffmann: Maximizing Angles in Plane Straight Line Graphs (Part I) [details]
2007
September
- September 27, 2007, Michael Hoffmann: Maximizing Angles in Plane Straight Line Graphs (Part II) [details]
2008
February
- February 26, 2008, Michael Hoffmann: An improved upper bound for wireless localization [details]
2009
- February 19, 2009, Michael Hoffmann: Happy points [details]
2010
- February 23, 2010, Michael Hoffmann: Min and Max with k Lies [details]
November
- November 11, 2010, Michael Hoffmann: Pointed binary encompassing trees: Simple and optimal [details]
2012
February
- February 23, 2012, Michael Hoffmann: Counting Plane Graphs: Pseudo-Flippability and Applications [details]
Upcoming talks | All previous talks | Talks by speaker |  Upcoming talks in iCal format (beta version!) Previous talks by year: 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.3392 | admin login
|
