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: Tuesday, August 20, 2013, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Sandro Feuz

Conjectured Lower Bounds for Dynamic Problems with a Communication Complexity Advice Model

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.

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