| 2009 |
|---|
| 52 | EE | Arne Andersson,
Jim Wilenius:
A New Analysis of Expected Revenue.
SOFSEM 2009: 1-2 |
| 2007 |
|---|
| 51 | EE | Jim Wilenius,
Arne Andersson:
Discovering Equilibrium Strategies for a Combinatorial First Price Auction.
CEC/EEE 2007: 13-20 |
| 50 | EE | Per Carlsson,
Arne Andersson:
A flexible model for tree-structured multi-commodity markets.
Electronic Commerce Research 7(1): 69-88 (2007) |
| 49 | EE | Arne Andersson,
Mikkel Thorup:
Dynamic ordered sets with exponential search trees.
J. ACM 54(3): 13 (2007) |
| 2005 |
|---|
| 48 | EE | Arne Andersson,
Jim Holmstrom,
Mattias Willman:
An Auction Mechanism for Polynomial-Time Execution with Combinatorial Constraints.
CEC 2005: 17-24 |
| 47 | EE | Per Carlsson,
Arne Andersson:
A Flexible Model for Tree-Structured Multi-commodity Markets.
CEC 2005: 50-57 |
| 2003 |
|---|
| 46 | EE | Per Carlsson,
Arne Andersson,
Fredrik Ygge:
A Tractable Mechanism for Time Dependent Markets.
CEC 2003: 31-34 |
| 45 | EE | Arne Andersson:
Combinatorial Auctions, an Example of Algorithm Theory in Real Life.
Computer Science in Perspective 2003: 13-21 |
| 2002 |
|---|
| 44 | EE | Kidane Asrat Ghebreamiak,
Arne Andersson:
Caching in multi-unit combinatorial auctions.
AAMAS 2002: 164-165 |
| 43 | EE | Arne Andersson,
Mikkel Thorup:
Dynamic Ordered Sets with Exponential Search Trees
CoRR cs.DS/0210006: (2002) |
| 2001 |
|---|
| 42 | EE | Arne Andersson,
Per Carlsson,
Fredrik Ygge:
Efficient Resource Allocation with Noisy Functions.
Algorithm Engineering 2001: 91-105 |
| 41 | EE | Arne Andersson,
Mikkel Thorup:
Dynamic string searching.
SODA 2001: 307-308 |
| 40 | EE | Per Carlsson,
Fredrik Ygge,
Arne Andersson:
Extending Equilibrium Markets.
IEEE Intelligent Systems 16(4): 18-26 (2001) |
| 2000 |
|---|
| 39 | EE | Arne Andersson,
Mattias Tenhunen,
Fredrik Ygge:
Integer Programming for Combinatorial Auction Winner Determination.
ICMAS 2000: 39-46 |
| 38 | EE | Arne Andersson,
Mikkel Thorup:
Tight(er) worst-case bounds on dynamic searching and priority queues.
STOC 2000: 335-342 |
| 37 | EE | Arne Andersson,
Torben Hagerup,
Johan Håstad,
Ola Petersson:
Tight Bounds for Searching a Sorted Array of Strings.
SIAM J. Comput. 30(5): 1552-1578 (2000) |
| 1999 |
|---|
| 36 | EE | Arne Andersson,
N. Jesper Larsson,
Kurt Swanson:
Suffix Trees on Words.
Algorithmica 23(3): 246-260 (1999) |
| 35 | | Arne Andersson:
General Balanced Trees.
J. Algorithms 30(1): 1-18 (1999) |
| 34 | EE | Arne Andersson,
Paul Davidsson,
Johan Lindén:
Measure-based classifier performance evaluation.
Pattern Recognition Letters 20(11-13): 1165-1173 (1999) |
| 33 | EE | Arne Andersson,
Peter Bro Miltersen,
Mikkel Thorup:
Fusion Trees can be Implemented with AC0 Instructions Only.
Theor. Comput. Sci. 215(1-2): 337-344 (1999) |
| 1998 |
|---|
| 32 | EE | Arne Andersson,
Stefan Nilsson:
Implementing Radixsort.
ACM Journal of Experimental Algorithmics 3: 7 (1998) |
| 31 | | Arne Andersson,
Ola Petersson:
Approximate Indexed Lists.
J. Algorithms 29(2): 256-276 (1998) |
| 30 | | Arne Andersson,
Torben Hagerup,
Stefan Nilsson,
Rajeev Raman:
Sorting in Linear Time?
J. Comput. Syst. Sci. 57(1): 74-93 (1998) |
| 1997 |
|---|
| 29 | | Arne Andersson,
Kurt Swanson:
On the Difficulty of Range Searching.
Comput. Geom. 8: 115-122 (1997) |
| 1996 |
|---|
| 28 | | Arne Andersson,
N. Jesper Larsson,
Kurt Swanson:
Suffix Trees on Words.
CPM 1996: 102-115 |
| 27 | | Arne Andersson:
Faster Deterministic Sorting and Searching in Linear Space.
FOCS 1996: 135-141 |
| 26 | | Arne Andersson,
Peter Bro Miltersen,
Søren Riis,
Mikkel Thorup:
Static Dictionaries on AC0 RAMs: Query Time Theta(sqrt(log n/log log n)) is Necessary and Sufficient.
FOCS 1996: 441-450 |
| 25 | | Arne Andersson:
Sorting and Searching Revisted.
SWAT 1996: 185-197 |
| 24 | | Arne Andersson,
Andrej Brodnik:
Comments on Self-Indexed Sort.
SIGPLAN Notices 31(8): 40-41 (1996) |
| 1995 |
|---|
| 23 | | Arne Andersson:
Sublogarithmic Searching without Multiplications.
FOCS 1995: 655-663 |
| 22 | | Arne Andersson,
Ola Petersson:
On-line Approximate List Indexing with Applications.
SODA 1995: 20-27 |
| 21 | EE | Arne Andersson,
Johan Håstad,
Ola Petersson:
A tight lower bound for searching a sorted array.
STOC 1995: 417-426 |
| 20 | EE | Arne Andersson,
Torben Hagerup,
Stefan Nilsson,
Rajeev Raman:
Sorting in linear time?
STOC 1995: 427-436 |
| 19 | | Arne Andersson,
Kurt Swanson:
On the Difficulty of Range Searching.
WADS 1995: 473-481 |
| 18 | | Arne Andersson,
Thomas Ottmann:
New Tight Bounds on Uniquely Represented Dictionaries.
SIAM J. Comput. 24(5): 1091-1101 (1995) |
| 17 | | Arne Andersson,
Stefan Nilsson:
Efficient Implementation of Suffix Trees.
Softw., Pract. Exper. 25(2): 129-141 (1995) |
| 1994 |
|---|
| 16 | | Arne Andersson,
Stefan Nilsson:
Faster Searching in Tries and Quadtrees - An Analysis of Level Compression.
ESA 1994: 82-93 |
| 15 | | Arne Andersson,
Stefan Nilsson:
A New Efficient Radix Sort
FOCS 1994: 714-721 |
| 14 | EE | Arne Andersson,
Torben Hagerup,
Johan Håstad,
Ola Petersson:
The complexity of searching a sorted array of strings.
STOC 1994: 317-325 |
| 1993 |
|---|
| 13 | | Arne Andersson,
Christer Mattsson:
Dynamic Interpolation Search in o(log log n) Time.
ICALP 1993: 15-27 |
| 12 | | Arne Andersson:
Balanced Search Trees Made Simple.
WADS 1993: 60-71 |
| 11 | | Arne Andersson,
Stefan Nilsson:
Improved Behaviour of Tries by Adaptive Branching.
Inf. Process. Lett. 46(6): 295-300 (1993) |
| 1992 |
|---|
| 10 | | Arne Andersson:
Comments on "On the Balance Property of Patricia Tries: External Path Length Viewpoint".
Theor. Comput. Sci. 106(2): 391-393 (1992) |
| 1991 |
|---|
| 9 | | Arne Andersson,
Thomas Ottmann:
Faster Uniquely Represented Dictionaries
FOCS 1991: 642-649 |
| 8 | | Arne Andersson,
Tony W. Lai:
Comparison-Efficient And Write-Optimal Searching and Sorting.
ISA 1991: 273-282 |
| 7 | | Arne Andersson:
A Note on Searching in a Binary Search Tree.
Softw., Pract. Exper. 21(10): 1125-1128 (1991) |
| 1990 |
|---|
| 6 | | Arne Andersson,
Tony W. Lai:
Fast Updating of Well-Balanced Trees.
SWAT 1990: 111-121 |
| 5 | | Arne Andersson,
Christian Icking,
Rolf Klein,
Thomas Ottmann:
Binary Search Trees of Almost Optimal Height.
Acta Inf. 28(2): 165-178 (1990) |
| 4 | | Arne Andersson:
A Note on the Expected Behaviour of Binary Tree Traversals.
Comput. J. 33(5): 471-472 (1990) |
| 3 | | Arne Andersson,
Svante Carlsson:
Construction of a Tree From its Traversals in Optimal Time and Space.
Inf. Process. Lett. 34(1): 21-25 (1990) |
| 1989 |
|---|
| 2 | | Arne Andersson:
Optimal Bounds on the Dictionary Problem.
Optimal Algorithms 1989: 106-114 |
| 1 | | Arne Andersson:
Improving Partial Rebuilding by Using Simple Balance Criteria.
WADS 1989: 393-402 |
