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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, December 01, 2011, 12:15 pm

Duration: 45 minutes

Location: CAB G51

Speaker: Isabelle Hurbain-Palatin

Sorting by placement and shift

This paper by Sergi Elizalde and Peter Winkler analyses "homing", a sorting algorithm motivated by the hand-sorting of files. Elements are placed in their proper positions; the sorting is done "in place" by shifting the necessary elements.
Considering the number of steps involved, the following results are proved:
- the best case is fast,
- the worst case is very slow (but the algorithm always terminates),
- there is a super-exponential number of worst cases.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   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