University of Otago logo. Computer and Information Science Seminars

Seminar Homepage


Mike Atkinson - Department of Computer Science


Some things you didn't know about priority queues


Archway 2 - 1:00 pm, Friday 11 May


A priority queue supports two fundamental operations: insert a new item, and remove the current smallest item. These operations enable a priority queue to be used to sort data into increasing order (as in the well-known heapsort algorithm). But if one wishes to generate outputs in some other order than increasing many interesting issues arise. The lecture will describe what is known about how priority queues can reorder a data stream, and will show how priority queues are connected with the long-standing Otago Theory Group investigations into permutation patterns.

Last modified: Wednesday, 02-May-2012 11:53:47 NZST

This page is maintained by the seminar list administrator.