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

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Tuesday, April 22, 2008, 12:15 pm

**Duration**: This information is not available in the database

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

**Speaker**: Fabian Kuhn

In today's computing environments, data is no longer stored at one central server. Often, data is distributed across many heterogeneous locations that are connected through a network. Nevertheless, there need to be efficient methods to query large data sets. In the talk, I will consider the problem of distributed k-selection where, given a connected graph of diameter D consisting of n nodes in which every node holds an element, the goal is to determine the kth smallest of these elements. I will present a simple distributed randomized algorithm with time complexity O(D*log_D(n)) and I will prove a lower bound of Omega(D*log_D(n)) implying that the presented algorithm is asymptotically optimal.

Joint work with Thomas Locher and Roger Wattenhofer.

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