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, June 15, 2006, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Björn Steffen

Closest-point problems simplified on the RAM

By Timothy M. Chan (SODA 2002)

Basic proximity problems for low-dimensional point sets, such as closest pair and approximate nearest neighbor, have been studied extensively in the computational geometry literature. Generally, optimal algorithms designed for worst-case input require hierarchical spatial structures with sophisticated balancing conditions. But sometimes much simpler algorithms with the same performance are possible using standard, though nonalgebraic, RAM operations.


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