Sorting is an apparently solved problem. Yet there are very many input sequences that even our most powerful processors are incapable of sorting. What do we do under these conditions? How can we measure the imperfections of our sorting algorithms? The seminar is an introduction to some aspects of work done by the Computer Theory group and is offered with the intention of getting across general ideas rather than causing severe intellectual pain.
Last modified: Thursday, 28-Jul-2005 17:23:30 NZST
This page is maintained by the seminar list administrator.