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, April 08, 2010, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Micha Sharir (Tel Aviv University)

Improved bounds for geometric permutations in higher dimensions

I will present an improved bound of O(n3\log n) on the number of geometric permutations of a set of n arbitrary pairwise disjoint compact convex sets in three dimensions, which is the first improvement over Wenger's general bound from 1990. The result extends to higher dimensions too.

Joint work with Natan Rubin and Haim Kaplan.

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