KTH
CSC
Stefan Nilsson
Texts
Texts
Textbooks
English
Go for Java programmers
Svenska
Algoritmer och datastrukturer
Svensk Javaterminologi
Popular presentations
English
Fast IP routing with LC-tries
The fastest sorting algorithm?
How to avoid initializing memory
High performance computing with Java
Treaps in Java
Svenska
Frågor om OneSwarm
Nätet – hur stor är revolutionen?
När algoritmen möter hårdvaran
Research papers
English
IP-address lookup using LC-tries
Fast address look-up for Internet routers
Improved behaviour of tries by adaptive branching
A new efficient radix sort
Sorting in linear time?
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
An experimental study of compression methods for functional tries
Implementing radixsort
Radix sorting & searching
Faster searching in tries and quadtrees – an analysis of level compression
Blasting past fusion trees
Efficient implementation of suffix trees
Svenska
Att utvärderas och utvecklas: om datalogi och medieteknik i ljuset av EAE på KTH