Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, August 20, 2013, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Sandro Feuz
For many dynamic versions of classical algorithmic problems no strong lower bounds are known today. In the paper "Towards Polynomial Lower Bounds for Dynamic Problems" (Patrascu, 2010) the author conjectures polynomial lower bounds for a wide range of dynamic problems and shows how a new three player, number-on-forehead communication complexity model could be used to prove them. Pitassi et al further formalize the model, disprove one of Patrascu's conjectures and show other interesting results ("A Little Advice Can Be Very Helpful", 2012). We will give an overview of the two papers.
Automatic MiSe System Software Version 1.4803M | admin login