Searching for authors named "Stefan Nilsson" – sorted by Relevance.
-
Mobile Usability - Rigour meets relevance when usability goes mobile," IRIS24
- Nilsson {tomas, stefan}@(email omitted); Laboratorium for Interaction Technology University
- Cited by 2 (0 self) – Add To MetaCart
-
A New Efficient Radix Sort
- A New Efficient Radix Sort Arne Andersson Stefan Nilsson Department of Computer Science Department
- Cited by 24 (7 self) – Add To MetaCart
-
Implementing a Dynamic Compressed Trie
- --36 Implementing a dynamic compressed trie Stefan Nilsson Helsinki University of Technology e-mail: Stefan.Nilsson
- Cited by 8 (1 self) – Add To MetaCart
-
An Experimental Study of Compression Methods for Dynamic Tries
- An experimental study of compression methods for dynamic tries Stefan Nilsson 1 Helsinki
- Cited by 7 (1 self) – Add To MetaCart
-
Efficient Implementation of Suffix Trees
- of Suffix Trees ARNE ANDERSSON AND STEFAN NILSSON Department of Computer Science, Lund University, Box 118
- Cited by 28 (3 self) – Add To MetaCart
-
Improved Behaviour of Tries by Adaptive Branching
- by Adaptive Branching \Lambda Arne Andersson Stefan Nilsson Department of Computer Science, Lund University
- Cited by 25 (8 self) – Add To MetaCart
-
Faster Searching in Tries and Quadtrees -- An Analysis of Level Compression
- Arne Andersson Stefan Nilsson Department of Computer Science, Lund University, Box 118, S-221 00 Lund
- Cited by 11 (6 self) – Add To MetaCart
-
Fast address lookup for Internet routers
- Fast address lookup for Internet routers Stefan Nilsson Helsinki University of Technology P.O. Box
- Cited by 68 (4 self) – Add To MetaCart
-
Implementing Radixsort
- -221 00 Lund, Sweden e-mail: arne@(email omitted); Stefan Nilsson Department of Computer Science, Helsinki
- Cited by 11 (1 self) – Add To MetaCart
-
IP-Address Lookup Using LC-Tries
- IP-Address Lookup Using LC-Tries Stefan Nilsson Department of Computer Science P.O. Box 1100
- Cited by 73 (0 self) – Add To MetaCart

