Arne Andersson

Publication Activity (10 Years)

Years Active: 1989-2009
Publications (10 Years): 0

Publications

Arne Andersson, Jim Wilenius
A New Analysis of Expected Revenue. SOFSEM (2009)
Jim Wilenius, Arne Andersson
Discovering Equilibrium Strategies for a Combinatorial First Price Auction. CEC/EEE (2007)
Arne Andersson, Mikkel Thorup
Dynamic ordered sets with exponential search trees. J. ACM 54 (3) (2007)
Per Carlsson, Arne Andersson
A flexible model for tree-structured multi-commodity markets. Electron. Commer. Res. 7 (1) (2007)
Maria Karlsson, Fredrik Ygge, Arne Andersson
Market-Based Approaches to Optimization. Comput. Intell. 23 (1) (2007)
Arne Andersson, Jim Holmstrom, Mattias Willman
An Auction Mechanism for Polynomial-Time Execution with Combinatorial Constraints. CEC (2005)
Per Carlsson, Arne Andersson
A Flexible Model for Tree-Structured Multi-commodity Markets. CEC (2005)
Arne Andersson
Combinatorial Auctions, an Example of Algorithm Theory in Real Life. Computer Science in Perspective (2003)
Per Carlsson, Arne Andersson, Fredrik Ygge
A Tractable Mechanism for Time Dependent Markets. CEC (2003)
Kidane Asrat Ghebreamiak, Arne Andersson
Caching in multi-unit combinatorial auctions. AAMAS (2002)
Arne Andersson, Per Carlsson, Fredrik Ygge
Resource Allocation with Wobbly Functions. Comput. Optim. Appl. 23 (2) (2002)
Arne Andersson, Mikkel Thorup
Dynamic Ordered Sets with Exponential Search Trees CoRR (2002)
Arne Andersson, Fredrik Ygge
Efficient Resource Allocation with Non-Concave Objective Functions. Comput. Optim. Appl. 20 (3) (2001)
Arne Andersson, Mikkel Thorup
Dynamic string searching. SODA (2001)
Per Carlsson, Fredrik Ygge, Arne Andersson
Extending Equilibrium Markets. IEEE Intell. Syst. 16 (4) (2001)
Arne Andersson, Per Carlsson, Fredrik Ygge
Efficient Resource Allocation with Noisy Functions. WAE (2001)
Arne Andersson, Mattias Tenhunen, Fredrik Ygge
Integer Programming for Combinatorial Auction Winner Determination. ICMAS (2000)
Arne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson
Tight Bounds for Searching a Sorted Array of Strings. SIAM J. Comput. 30 (5) (2000)
Arne Andersson, Mikkel Thorup
Tight(er) worst-case bounds on dynamic searching and priority queues. STOC (2000)
Arne Andersson, Peter Bro Miltersen, Mikkel Thorup
Instructions Only. Theor. Comput. Sci. 215 (1-2) (1999)
Arne Andersson
General Balanced Trees. J. Algorithms 30 (1) (1999)
Arne Andersson, N. Jesper Larsson, Kurt Swanson
Suffix Trees on Words. Algorithmica 23 (3) (1999)
Arne Andersson, Paul Davidsson, Johan Lindén
Measure-based classifier performance evaluation. Pattern Recognit. Lett. 20 (11-13) (1999)
Arne Andersson, Stefan Nilsson
Implementing Radixsort. ACM J. Exp. Algorithmics 3 (1998)
Arne Andersson, Fredrik Ygge
Managing Large Scale Computational Markets. HICSS (7) (1998)
Arne Andersson, Ola Petersson
Approximate Indexed Lists. J. Algorithms 29 (2) (1998)
Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman
Sorting in Linear Time? J. Comput. Syst. Sci. 57 (1) (1998)
Arne Andersson, Stefan Nilsson
Implementing Radixsort. WAE (1997)
Arne Andersson, Kurt Swanson
On the Difficulty of Range Searching. Comput. Geom. 8 (1997)
Arne Andersson
Faster Deterministic Sorting and Searching in Linear Space. FOCS (1996)
Arne Andersson, Andrej Brodnik
Comments on Self-Indexed Sort. ACM SIGPLAN Notices 31 (8) (1996)
Arne Andersson
Sorting and Searching Revisted. SWAT (1996)
Arne Andersson, N. Jesper Larsson, Kurt Swanson
Suffix Trees on Words. CPM (1996)
Arne Andersson, Peter Bro Miltersen, Søren Riis, Mikkel Thorup
RAMs: Query Time Theta(sqrt(log n/log log n)) is Necessary and Sufficient. FOCS (1996)
Arne Andersson, Johan Håstad, Ola Petersson
A tight lower bound for searching a sorted array. STOC (1995)
Arne Andersson, Ola Petersson
On-line Approximate List Indexing with Applications. SODA (1995)
Arne Andersson, Thomas Ottmann
New Tight Bounds on Uniquely Represented Dictionaries. SIAM J. Comput. 24 (5) (1995)
Arne Andersson
Sublogarithmic Searching without Multiplications. FOCS (1995)
Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman
Sorting in linear time? STOC (1995)
Arne Andersson, Stefan Nilsson
Efficient Implementation of Suffix Trees. Softw. Pract. Exp. 25 (2) (1995)
Arne Andersson, Kurt Swanson
On the Difficulty of Range Searching. WADS (1995)
Arne Andersson, Stefan Nilsson
A New Efficient Radix Sort FOCS (1994)
Arne Andersson, Stefan Nilsson
Faster Searching in Tries and Quadtrees - An Analysis of Level Compression. ESA (1994)
Arne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson
The complexity of searching a sorted array of strings. STOC (1994)
Arne Andersson
Balanced Search Trees Made Simple. WADS (1993)
Arne Andersson, Christer Mattsson
Dynamic Interpolation Search in o(log log n) Time. ICALP (1993)
Arne Andersson, Stefan Nilsson
Improved Behaviour of Tries by Adaptive Branching. Inf. Process. Lett. 46 (6) (1993)
Arne Andersson
Comments on "On the Balance Property of Patricia Tries: External Path Length Viewpoint". Theor. Comput. Sci. 106 (2) (1992)
Arne Andersson, Tony W. Lai
Comparison-Efficient And Write-Optimal Searching and Sorting. ISA (1991)
Arne Andersson, Thomas Ottmann
Faster Uniquely Represented Dictionaries FOCS (1991)
Arne Andersson
Maintaining α-balanced trees by partial rebuilding. Int. J. Comput. Math. 38 (1-2) (1991)
Arne Andersson
A Note on Searching in a Binary Search Tree. Softw. Pract. Exp. 21 (10) (1991)
Arne Andersson
A Note on the Expected Behaviour of Binary Tree Traversals. Comput. J. 33 (5) (1990)
Arne Andersson, Christian Icking, Rolf Klein, Thomas Ottmann
Binary Search Trees of Almost Optimal Height. Acta Informatica 28 (2) (1990)
Arne Andersson, Svante Carlsson
Construction of a Tree From its Traversals in Optimal Time and Space. Inf. Process. Lett. 34 (1) (1990)
Arne Andersson, Tony W. Lai
Fast Updating of Well-Balanced Trees. SWAT (1990)
Arne Andersson
Improving Partial Rebuilding by Using Simple Balance Criteria. WADS (1989)
Arne Andersson
Optimal Bounds on the Dictionary Problem. Optimal Algorithms (1989)