Time+Place: Tuesday 05/06/2012 14:30 Room 337-8 Taub Bld.
Title: The surprises of Quick Sort
Speaker: Micha Hofri http://web.cs.wpi.edu/~hofri/
Affiliation: Department of Computer Science, Worcester Polytechnic Institute
Host: Hadas Shachnai

Abstract:


Quick Sort was invented more than 50 years ago and has been surprising
algorithmicians by its effectiveness and the extent to which it could be
adapted and improved.  We shall survey some of this improvements and show a
recent calculation that was unexpected as well.

Short Bio:
Micha Hofri is a professor at the department of Computer Science at WPI
(Worcester Polytechnic Institute); head: 1999-2004.
He earned academic degrees in Physics and industrial engineering, all from
the Technion in Haifa, Israel.
His current research interests are the use of applied probability and
asymptotic techniques in the analysis of computer software and algorithms,
and in using computer tools to aid in his design of furniture.
Member of the ACM, IEEE/CS and SIAM.


Refreshments served from 14:15 on,
 	Lecture starts at 14:30