It is hard to be a successfull thief these days :( Ah well, I have got stuff to read. Allan and I have a weekly read-and-go-through-a-paper meeting, this week it is one of Gerths papers, called Cache-Oblivious Search Trees via Binary Trees of Small Height, now repeat that fast 10 times. For some strange reason all the papers we have read so far in these meetings have had Gerth as a co-author, that guy is just everywhere :).