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: Thursday, May 12, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Martin Aigner (FU Berlin)

Pancake Problems

The pancake problem is a well-known combinatorial problem that seems to have applications in parallel processing. Given a stack of n pancakes in arbitrary order, all of different sizes, the goal is to sort them into the size-ordered configuration. The allowed sorting operation is top-flip where the first k pancakes are taken up and replaced in reversed order.

I discuss some of the known results on the length needed to sort a stack of n pancakes and give a survey of several natural variants, including some problems that, surprisingly, despite their simplicity seem to present formidable challenges.

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