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: Friday, September 27, 2013, 12:15 pm

Duration: 30 minutes

Location: CAB G61

Speaker: Raimund Seidel (Universität des Saarlandes)

Estimating the Number of Triangulations of a Planar Point Set

Like all problems in #P, determining the number of straight edge triangulations of a planar point set admits an unbiased estimator that can be computed in polynomial expected time. I will discuss the practicability and usefulness of such estimators.


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