Prof. Emo Welzl and Prof. Bernd Gärtner
|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)
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.
Automatic MiSe System Software Version 1.4803M | admin login