Publications

Popular presentations

Frågor om OneSwarm
Nätet - hur stor är revolutionen?
High performance computing with Java technology
The fastest sorting algorithm?
Fast IP routing with LC-tries
Treaps in Java
Svensk Javaterminologi
När algoritmen möter hårdvaran

Research articles

TRASH - A dynamic LC-trie and hash data structure
An efficient list implementation
An experimental study of compression methods for dynamic tries
Implementing a dynamic compressed trie
IP-address lookup using LC-tries
Fast address look-up for Internet routers
An experimental study of compression methods for functional tries
Implementing radixsort
Radix sorting & searching
Improved behaviour of tries by adaptive branching
Faster searching in tries and quadtrees -- an analysis of level compression
Blasting past fusion trees
A new efficient radix sort
Efficient implementation of suffix trees
Sorting in linear time?