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, March 09, 2021, 12:15 pm

Duration: 30 minutes

Location: Zoom: conference room

Speaker: Christoph Grunau

A gap in the Randomized Local Computation Complexity Landscape

The Local Computation Algorithm (LCA) model is a popular model in the field of sublinear-time algorithms that measures the complexity of an algorithm by the number of probes the algorithm makes in the neighborhood of one node to determine that node’s output. In this talk, I show that every randomized LCA algorithm for a locally checkable problem with a probe complexity of o(\sqrt{log n}) can be turned into a deterministic LCA algorithm with a probe complexity of O(log*n). I also sketch how additional ideas lead to an Omega(log n) lower bound for the Lovasz Local Lemma (LLL) on constant degree graphs. This talk is based on joint work with Sebastian Brandt and Vasek Rozhon.

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