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, February 28, 2006, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Eva Schuberth

Approximate Sorting

This talk is about the question of how many comparisons are necessary and sufficient in order to approximately rank n items. We show that any comparison based, randomized algorithm to approximate any given ranking of n items within expected Spearman's footrule distance n2/r needs at least n(min{log r, log n} -6) comparisons in the worst case. This bound is tight up to a constant factor since there exists a deterministic algorithm that shows that 6n log(r) comparisons are always sufficient.

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