KTH
EECS
Stefan Nilsson
Texts
Texts
Open textbooks
Algorithms to Go
Texts about algorithms and Go, with plenty of code examples.
Go gotcha
Pifalls and corner cases
Concurrent programming
Go for Java programmers
Your basic API
Thoughts on good API design
Your basic func
Unexpected functional programming in Go
Your basic int
A tribute to an underrated data type
Algoritmer och datastrukturer
Svensk Javaterminologi
Other texts
Top programming languages 00-18
Go vs Java
Printing null in Java
Fast IP routing with LC-tries
The fastest sorting algorithm?
High performance computing with Java
Treaps in Java
Att äga tankar
Några tankar om undervisning
Frågor om OneSwarm
Nätet – hur stor är revolutionen?
När algoritmen möter hårdvaran
3-card monte
Blackjack
Research
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
Att utvärderas och utvecklas: om datalogi och medieteknik i ljuset av EAE på KTH