Date: 21 Mar 2003
From: jyrki@diku.dk
Subject: STL talk

Topic: Experiments with binary search trees and linear-time sorting 
algorithms in the STL framework
Speaker: Hervé Brönnimann, Polytechnic University, New York
Time:  Monday, 24 March 2003, 14.15–15.00
Place: UP1 at DIKU

In this talk, I will present several implementations of binary search
trees and like structures, suitable for implementing a C++STL set. I
will present several design choices and tricks that can be used for
speeding up and compacting the representation. I will report on the
effects of these tricks with the running time.

I will also present an implementation of linear-time sorting
algorithms such as counting and radix sort, and compare them with
std::sort for various suitable data types.

PE-labs home page: http://www.diku.dk/~jyrki/PE-lab/