Optimal Bounds on the Dictionary Problem. - Arne Andersson (Optimal Algorithms, 1989)

Improving Partial Rebuilding by Using Simple Balance Criteria. - Arne Andersson (WADS, 1989)

Fast Updating of Well-Balanced Trees. - Arne Andersson; Tony W. Lai (SWAT, 1990)

Binary Search Trees of Almost Optimal Height. - Arne Andersson; Christian Icking; Rolf Klein; Thomas Ottmann (Acta Informatica, 1990)

A Note on the Expected Behaviour of Binary Tree Traversals. - Arne Andersson (Comput. J., 1990)

Construction of a Tree From its Traversals in Optimal Time and Space. - Arne Andersson; Svante Carlsson (Inf. Process. Lett., 1990)

Faster Uniquely Represented Dictionaries - Arne Andersson; Thomas Ottmann (FOCS, 1991)

Comparison-Efficient And Write-Optimal Searching and Sorting. - Arne Andersson; Tony W. Lai (ISA, 1991)

Maintaining α-balanced trees by partial rebuilding. - Arne Andersson (Int. J. Comput. Math., 1991)

A Note on Searching in a Binary Search Tree. - Arne Andersson (Softw. Pract. Exp., 1991)

Comments on "On the Balance Property of Patricia Tries: External Path Length Viewpoint". - Arne Andersson (Theor. Comput. Sci., 1992)

Dynamic Interpolation Search in o(log log n) Time. - Arne Andersson; Christer Mattsson (ICALP, 1993)

Balanced Search Trees Made Simple. - Arne Andersson (WADS, 1993)

Improved Behaviour of Tries by Adaptive Branching. - Arne Andersson; Stefan Nilsson (Inf. Process. Lett., 1993)

Faster Searching in Tries and Quadtrees - An Analysis of Level Compression. - Arne Andersson; Stefan Nilsson (ESA, 1994)

A New Efficient Radix Sort - Arne Andersson; Stefan Nilsson (FOCS, 1994)

The complexity of searching a sorted array of strings. - Arne Andersson; Torben Hagerup; Johan Håstad; Ola Petersson (STOC, 1994)

Sublogarithmic Searching without Multiplications. - Arne Andersson (FOCS, 1995)

On-line Approximate List Indexing with Applications. - Arne Andersson; Ola Petersson (SODA, 1995)

A tight lower bound for searching a sorted array. - Arne Andersson; Johan Håstad; Ola Petersson (STOC, 1995)

New Tight Bounds on Uniquely Represented Dictionaries. - Arne Andersson; Thomas Ottmann (SIAM J. Comput., 1995)

Efficient Implementation of Suffix Trees. - Arne Andersson; Stefan Nilsson (Softw. Pract. Exp., 1995)

Faster Deterministic Sorting and Searching in Linear Space. - Arne Andersson (FOCS, 1996)

Static Dictionaries on AC0 RAMs: Query Time Theta(sqrt(log n/log log n)) is Necessary and Sufficient. - Arne Andersson; Peter Bro Miltersen; Søren Riis; Mikkel Thorup (FOCS, 1996)

Sorting and Searching Revisted. - Arne Andersson (SWAT, 1996)

Comments on Self-Indexed Sort. - Arne Andersson; Andrej Brodnik (ACM SIGPLAN Notices, 1996)

On the Difficulty of Range Searching. - Arne Andersson; Kurt Swanson (Comput. Geom., 1997)

Managing Large Scale Computational Markets. - Arne Andersson; Fredrik Ygge (HICSS (7), 1998)

Approximate Indexed Lists. - Arne Andersson; Ola Petersson (J. Algorithms, 1998)

Sorting in Linear Time? - Arne Andersson; Torben Hagerup; Stefan Nilsson; Rajeev Raman (J. Comput. Syst. Sci., 1998)

Implementing Radixsort. - Arne Andersson; Stefan Nilsson (ACM J. Exp. Algorithmics, 1998)

Suffix Trees on Words. - Arne Andersson; N. Jesper Larsson; Kurt Swanson (Algorithmica, 1999)

General Balanced Trees. - Arne Andersson (J. Algorithms, 1999)

Measure-based classifier performance evaluation. - Arne Andersson; Paul Davidsson; Johan Lindén (Pattern Recognit. Lett., 1999)

Fusion Trees can be Implemented with AC0 Instructions Only. - Arne Andersson; Peter Bro Miltersen; Mikkel Thorup (Theor. Comput. Sci., 1999)

Integer Programming for Combinatorial Auction Winner Determination. - Arne Andersson; Mattias Tenhunen; Fredrik Ygge (ICMAS, 2000)

Tight(er) worst-case bounds on dynamic searching and priority queues. - Arne Andersson; Mikkel Thorup (STOC, 2000)

Tight Bounds for Searching a Sorted Array of Strings. - Arne Andersson; Torben Hagerup; Johan Håstad; Ola Petersson (SIAM J. Comput., 2000)

Dynamic string searching. - Arne Andersson; Mikkel Thorup (SODA, 2001)

Efficient Resource Allocation with Noisy Functions. - Arne Andersson; Per Carlsson; Fredrik Ygge (WAE, 2001)

Efficient Resource Allocation with Non-Concave Objective Functions. - Arne Andersson; Fredrik Ygge (Comput. Optim. Appl., 2001)

Extending Equilibrium Markets. - Per Carlsson; Fredrik Ygge; Arne Andersson (IEEE Intell. Syst., 2001)

Caching in multi-unit combinatorial auctions. - Kidane Asrat Ghebreamiak; Arne Andersson (AAMAS, 2002)

Resource Allocation with Wobbly Functions. - Arne Andersson; Per Carlsson; Fredrik Ygge (Comput. Optim. Appl., 2002)

Combinatorial Auctions, an Example of Algorithm Theory in Real Life. - Arne Andersson (Computer Science in Perspective, 2003)

A Tractable Mechanism for Time Dependent Markets. - Per Carlsson; Arne Andersson; Fredrik Ygge (CEC, 2003)

Searching and Priority Queues in o(log n) Time. - Arne Andersson (Handbook of Data Structures and Applications, 2004)

Balanced Binary Search Trees. - Arne Andersson; Rolf Fagerberg; Kim S. Larsen (Handbook of Data Structures and Applications, 2004)

An Auction Mechanism for Polynomial-Time Execution with Combinatorial Constraints. - Arne Andersson; Jim Holmstrom; Mattias Willman (CEC, 2005)

Discovering Equilibrium Strategies for a Combinatorial First Price Auction. - Jim Wilenius; Arne Andersson (CEC/EEE, 2007)

Market-Based Approaches to Optimization. - Maria Karlsson; Fredrik Ygge; Arne Andersson (Comput. Intell., 2007)

A flexible model for tree-structured multi-commodity markets. - Per Carlsson; Arne Andersson (Electron. Commer. Res., 2007)

Dynamic ordered sets with exponential search trees. - Arne Andersson; Mikkel Thorup (J. ACM, 2007)

A New Analysis of Expected Revenue. - Arne Andersson; Jim Wilenius (SOFSEM, 2009)