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, June 06, 2006, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Robin Moser
Given an ordering w ∈ ∪ Aj we want to determine to which subset Aj the ordering w belongs by performing a sequence of comparisons between the elements of S. The classical sorting problem corresponds to the case where the subsets Aj comprise the n! singleton sets of orderings.
If a sorting problem is defined by r nonempty subsets Aj, then the information theory bound states that at least log2(r) comparisons are required to solve that problem in the worst case. The purpose of this paper is to investigate the accuracy of this bound. While we show that it is usually very weak, we are nevertheless able to define a large class of problems for which this bound is good. As an application, we show that if X and Y are n element sets of real numbers, then the n2 element set X+Y can be sorted with O(n2) comparisons, improving upon the n2log(n) bound established by Harper et al. The problem of sorting X+Y was posed by Berlekamp."
[1] Fredman, M., How good is the information theory bound in sorting?, Theoretical Computer Science 1 (4), 1976, pp. 355-361.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2025 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