Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Thursday, April 27, 2017, 12:15 pm

**Duration**: 30 minutes

**Location**: OAT S15/S16/S17

**Speaker**: Pascal Su

Labeling schemes are a pair of encoder and decoder such that we can label the vertices of any rooted tree of given size, labeling the nodes with binary strings or numbers. Labels are chosen such that the decoder can perform certain queries in the tree with just the labels of two vertices, without knowing anything about the rest of the tree structure. As an example, this makes sense in the setting where we access large databases and queries can be costly. To not make this task trivial, we also we would like to minimize the largest label size.

This is joint work with Fabian Kuhn and Konstantinos Panagiotou

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