| 2009 | SOFSEM | A New Analysis of Expected Revenue. | Arne Andersson, Jim Wilenius |
| 2001 | SODA | Dynamic string searching. | Arne Andersson, Mikkel Thorup |
| 2000 | STOC | Tight(er) worst-case bounds on dynamic searching and priority queues. | Arne Andersson, Mikkel Thorup |
| 1996 | CPM | Suffix Trees on Words. | Arne Andersson, N. Jesper Larsson, Kurt Swanson |
| 1996 | FOCS | Faster Deterministic Sorting and Searching in Linear Space. | Arne Andersson |
| 1996 | FOCS | Static Dictionaries on AC | Arne Andersson, Peter Bro Miltersen, Sren Riis, Mikkel Thorup |
| 1995 | FOCS | Sublogarithmic Searching without Multiplications. | Arne Andersson |
| 1995 | SODA | On-line Approximate List Indexing with Applications. | Arne Andersson, Ola Petersson |
| 1995 | STOC | Sorting in linear time? | Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman |
| 1995 | STOC | A tight lower bound for searching a sorted array. | Arne Andersson, Johan Hstad, Ola Petersson |
| 1995 | WADS | On the Difficulty of Range Searching. | Arne Andersson, Kurt Swanson |
| 1994 | ESA | Faster Searching in Tries and Quadtrees - An Analysis of Level Compression. | Arne Andersson, Stefan Nilsson |
| 1994 | FOCS | A New Efficient Radix Sort | Arne Andersson, Stefan Nilsson |
| 1994 | STOC | The complexity of searching a sorted array of strings. | Arne Andersson, Torben Hagerup, Johan Hstad, Ola Petersson |
| 1993 | ICALP | Dynamic Interpolation Search in o(log log n) Time. | Arne Andersson, Christer Mattsson |
| 1993 | WADS | Balanced Search Trees Made Simple. | Arne Andersson |
| 1991 | FOCS | Faster Uniquely Represented Dictionaries | Arne Andersson, Thomas Ottmann |
| 1989 | WADS | Improving Partial Rebuilding by Using Simple Balance Criteria. | Arne Andersson |