| 2003 |
| 13 | EE | Magnus Wiklund,
Stefan Nilsson,
Christian Bjork,
Sven Mattisson:
A 2GHz image-reject receiver in a low IF architecture fabricated in a 0.1µm CMOS technology.
ISCAS (2) 2003: 161-164 |
| 2002 |
| 12 | EE | Stefan Nilsson,
Matti Tikkanen:
An Experimental Study of Compression Methods for Dynamic Tries.
Algorithmica 33(1): 19-33 (2002) |
| 2001 |
| 11 | EE | Stefan Nilsson:
Flow Simulations on Overlapping Grids.
PPAM 2001: 544-551 |
| 2000 |
| 10 | | Stefan Nilsson,
Lars Svensson,
Fredrik Bengtsson,
Christian Johansson:
The WebAwareness Experience - Enhancing a Website with People.
WebNet 2000: 973 |
| 1998 |
| 9 | | Stefan Nilsson,
Matti Tikkanen:
Implementing a Dynamic Compressed Trie.
Algorithm Engineering 1998: 25-36 |
| 8 | | Stefan Nilsson,
Gunnar Karlsson:
Fast address look-up for internet routers.
Broadband Communications 1998: 11-22 |
| 7 | EE | Arne Andersson,
Stefan Nilsson:
Implementing Radixsort.
ACM Journal of Experimental Algorithmics 3: 7 (1998) |
| 6 | | Arne Andersson,
Torben Hagerup,
Stefan Nilsson,
Rajeev Raman:
Sorting in Linear Time?
J. Comput. Syst. Sci. 57(1): 74-93 (1998) |
| 1995 |
| 5 | EE | Arne Andersson,
Torben Hagerup,
Stefan Nilsson,
Rajeev Raman:
Sorting in linear time?
STOC 1995: 427-436 |
| 4 | | Arne Andersson,
Stefan Nilsson:
Efficient Implementation of Suffix Trees.
Softw., Pract. Exper. 25(2): 129-141 (1995) |
| 1994 |
| 3 | | Arne Andersson,
Stefan Nilsson:
Faster Searching in Tries and Quadtrees - An Analysis of Level Compression.
ESA 1994: 82-93 |
| 2 | | Arne Andersson,
Stefan Nilsson:
A New Efficient Radix Sort
FOCS 1994: 714-721 |
| 1993 |
| 1 | | Arne Andersson,
Stefan Nilsson:
Improved Behaviour of Tries by Adaptive Branching.
Inf. Process. Lett. 46(6): 295-300 (1993) |