Arne Andersson

According to our database, Arne Andersson authored at least 54 papers between 1989 and 2009.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2009

A New Analysis of Expected Revenue.

Arne Andersson, Jim Wilenius

Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

2007

Dynamic ordered sets with exponential search trees.

Arne Andersson, Mikkel Thorup

J. ACM, 2007

A flexible model for tree-structured multi-commodity markets.

Per Carlsson, Arne Andersson

Electron. Commer. Res., 2007

Market-Based Approaches to Optimization.

Maria Karlsson, Fredrik Ygge, Arne Andersson

Comput. Intell., 2007

Discovering Equilibrium Strategies for a Combinatorial First Price Auction.

Jim Wilenius, Arne Andersson

Proceedings of the 9th IEEE International Conference on E-Commerce Technology (CEC 2007) / 4th IEEE International Conference on Enterprise Computing, 2007

2005

An Auction Mechanism for Polynomial-Time Execution with Combinatorial Constraints.

Arne Andersson, Jim Holmstrom, Mattias Willman

Proceedings of the 7th IEEE International Conference on E-Commerce Technology (CEC 2005), 2005

2004

Balanced Binary Search Trees.

Arne Andersson, Rolf Fagerberg, Kim S. Larsen

Proceedings of the Handbook of Data Structures and Applications., 2004

Searching and Priority Queues in o(log n) Time.

Arne Andersson

Proceedings of the Handbook of Data Structures and Applications., 2004

2003

A Tractable Mechanism for Time Dependent Markets.

Per Carlsson, Arne Andersson, Fredrik Ygge

Proceedings of the 2003 IEEE International Conference on Electronic Commerce (CEC 2003), 2003

Combinatorial Auctions, an Example of Algorithm Theory in Real Life.

Arne Andersson

Proceedings of the Computer Science in Perspective, Essays Dedicated to Thomas Ottmann, 2003

2002

Resource Allocation with Wobbly Functions.

Arne Andersson, Per Carlsson, Fredrik Ygge

Comput. Optim. Appl., 2002

Caching in multi-unit combinatorial auctions.

Kidane Asrat Ghebreamiak, Arne Andersson

Proceedings of the First International Joint Conference on Autonomous Agents & Multiagent Systems, 2002

2001

Extending Equilibrium Markets.

Per Carlsson, Fredrik Ygge, Arne Andersson

IEEE Intell. Syst., 2001

Efficient Resource Allocation with Non-Concave Objective Functions.

Arne Andersson, Fredrik Ygge

Comput. Optim. Appl., 2001

Efficient Resource Allocation with Noisy Functions.

Arne Andersson, Per Carlsson, Fredrik Ygge

Proceedings of the Algorithm Engineering, 2001

Dynamic string searching.

Arne Andersson, Mikkel Thorup

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000

Tight Bounds for Searching a Sorted Array of Strings.

Arne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson

SIAM J. Comput., 2000

Tight(er) worst-case bounds on dynamic searching and priority queues.

Arne Andersson, Mikkel Thorup

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Integer Programming for Combinatorial Auction Winner Determination.

Arne Andersson, Mattias Tenhunen, Fredrik Ygge

Proceedings of the 4th International Conference on Multi-Agent Systems, 2000

1999

Fusion Trees can be Implemented with AC⁰ Instructions Only.

Arne Andersson, Peter Bro Miltersen, Mikkel Thorup

Theor. Comput. Sci., 1999

Measure-based classifier performance evaluation.

Arne Andersson, Paul Davidsson, Johan Lindén

Pattern Recognit. Lett., 1999

General Balanced Trees.

Arne Andersson

J. Algorithms, 1999

Suffix Trees on Words.

Arne Andersson, N. Jesper Larsson, Kurt Swanson

Algorithmica, 1999

1998

Implementing Radixsort.

Arne Andersson, Stefan Nilsson

ACM J. Exp. Algorithmics, 1998

Sorting in Linear Time?

Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman

J. Comput. Syst. Sci., 1998

Approximate Indexed Lists.

Arne Andersson, Ola Petersson

J. Algorithms, 1998

Managing Large Scale Computational Markets.

Arne Andersson, Fredrik Ygge

Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences, 1998

1997

On the Difficulty of Range Searching.

Arne Andersson, Kurt Swanson

Comput. Geom., 1997

1996

Comments on Self-Indexed Sort.

Arne Andersson, Andrej Brodnik

ACM SIGPLAN Notices, 1996

Sorting and Searching Revisted.

Arne Andersson

Proceedings of the Algorithm Theory, 1996

Static Dictionaries on AC⁰ RAMs: Query Time Theta(sqrt(log n/log log n)) is Necessary and Sufficient.

Arne Andersson, Peter Bro Miltersen, Søren Riis, Mikkel Thorup

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

Faster Deterministic Sorting and Searching in Linear Space.

Arne Andersson

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1995

Efficient Implementation of Suffix Trees.

Arne Andersson, Stefan Nilsson

Softw. Pract. Exp., 1995

New Tight Bounds on Uniquely Represented Dictionaries.

Arne Andersson, Thomas Ottmann

SIAM J. Comput., 1995

A tight lower bound for searching a sorted array.

Arne Andersson, Johan Håstad, Ola Petersson

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

On-line Approximate List Indexing with Applications.

Arne Andersson, Ola Petersson

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Sublogarithmic Searching without Multiplications.

Arne Andersson

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994

The complexity of searching a sorted array of strings.

Arne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

A New Efficient Radix Sort

Arne Andersson, Stefan Nilsson

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

Faster Searching in Tries and Quadtrees - An Analysis of Level Compression.

Arne Andersson, Stefan Nilsson

Proceedings of the Algorithms, 1994

1993

Improved Behaviour of Tries by Adaptive Branching.

Arne Andersson, Stefan Nilsson

Inf. Process. Lett., 1993

Balanced Search Trees Made Simple.

Arne Andersson

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Dynamic Interpolation Search in o(log log n) Time.

Arne Andersson, Christer Mattsson

Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992

Comments on "On the Balance Property of Patricia Tries: External Path Length Viewpoint".

Arne Andersson

Theor. Comput. Sci., 1992

1991

A Note on Searching in a Binary Search Tree.

Arne Andersson

Softw. Pract. Exp., 1991

Maintaining α-balanced trees by partial rebuilding.

Arne Andersson

Int. J. Comput. Math., 1991

Comparison-Efficient And Write-Optimal Searching and Sorting.

Arne Andersson, Tony W. Lai

Proceedings of the ISA '91 Algorithms, 1991

Faster Uniquely Represented Dictionaries

Arne Andersson, Thomas Ottmann

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

Construction of a Tree From its Traversals in Optimal Time and Space.

Arne Andersson, Svante Carlsson

Inf. Process. Lett., 1990

A Note on the Expected Behaviour of Binary Tree Traversals.

Arne Andersson

Comput. J., 1990

Binary Search Trees of Almost Optimal Height.

Arne Andersson, Christian Icking, Rolf Klein, Thomas Ottmann

Acta Informatica, 1990

Fast Updating of Well-Balanced Trees.

Arne Andersson, Tony W. Lai

Proceedings of the SWAT 90, 1990

1989

Improving Partial Rebuilding by Using Simple Balance Criteria.

Arne Andersson

Proceedings of the Algorithms and Data Structures, 1989

Optimal Bounds on the Dictionary Problem.

Arne Andersson

Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989