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 A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, April 07, 2011, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Gabriel Nivasch

Lower bounds for epsilon-nets

Up until recently people did not believe epsilon-nets could require superlinear lower bounds in geometric settings, but in this talk we will present two recent such bounds, both in the plane: Pach and Tardos (SoCG'11) got an Omega(1/eps log log 1/eps) bound for axis-parallel rectangles (and this bound is known to be tight); and Alon (FOCS'10) got an Omega(1/eps alpha(1/eps)) bound for lines in the plane.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   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