Arne Andersson - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 57 from 57

2009

A New Analysis of Expected RevenueArne Andersson, Jim Wilenius. sofsem 2009: 1-2 [doi]

2007

2005

An Auction Mechanism for Polynomial-Time Execution with Combinatorial ConstraintsArne Andersson, Jim Holmstrom, Mattias Willman. wecwis 2005: 17-24 [doi]

A Flexible Model for Tree-Structured Multi-commodity MarketsPer Carlsson, Arne Andersson. wecwis 2005: 50-57 [doi]

2003

Combinatorial Auctions, an Example of Algorithm Theory in Real LifeArne Andersson. BIRTHDAY 2003: 13-21 [doi]

A Tractable Mechanism for Time Dependent MarketsPer Carlsson, Arne Andersson, Fredrik Ygge. wecwis 2003: 31-34 [doi]

2002

Resource Allocation with Wobbly FunctionsArne Andersson, Per Carlsson, Fredrik Ygge. coap, 23(2):171-200, 2002. [doi]

Caching in multi-unit combinatorial auctionsKidane Asrat Ghebreamiak, Arne Andersson. atal 2002: 164-165 [doi]

2001

2000

Integer Programming for Combinatorial Auction Winner DeterminationArne Andersson, Mattias Tenhunen, Fredrik Ygge. icmas 2000: 39-46 [doi]

Tight Bounds for Searching a Sorted Array of StringsArne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson. SICOMP, 30(5):1552-1578, 2000. [doi]

Tight(er) worst-case bounds on dynamic searching and priority queuesArne Andersson, Mikkel Thorup. stoc 2000: 335-342 [doi]

1999

Suffix Trees on WordsArne Andersson, N. Jesper Larsson, Kurt Swanson. algorithmica, 23(3):246-260, 1999. [doi]

General Balanced TreesArne Andersson. jal, 30(1):1-18, 1999.

Fusion Trees can be Implemented with AC:::0::: Instructions OnlyArne Andersson, Peter Bro Miltersen, Mikkel Thorup. TCS, 215(1-2):337-344, 1999. [doi]

Measure-based classifier performance evaluationArne Andersson, Paul Davidsson, Johan Lindén. prl, 20(11-13):1165-1173, 1999. [doi]

1998

Sorting in Linear Time?Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman. jcss, 57(1):74-93, 1998.

Approximate Indexed ListsArne Andersson, Ola Petersson. jal, 29(2):256-276, 1998.

Implementing RadixsortArne Andersson, Stefan Nilsson. jea, 3:7, 1998. [doi]

Managing Large Scale Computational MarketsArne Andersson, Fredrik Ygge. hicss 1998: 4-13 [doi]

1997

On the Difficulty of Range SearchingArne Andersson, Kurt Swanson. comgeo, 8:115-122, 1997.

Implementing RadixsortArne Andersson, Stefan Nilsson. wae 1997: 156-165

1996

1995

1994

A New Efficient Radix SortArne Andersson, Stefan Nilsson. focs 1994: 714-721

Faster Searching in Tries and Quadtrees - An Analysis of Level CompressionArne Andersson, Stefan Nilsson. esa 1994: 82-93

The complexity of searching a sorted array of stringsArne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson. stoc 1994: 317-325 [doi]

1993

Improved Behaviour of Tries by Adaptive BranchingArne Andersson, Stefan Nilsson. ipl, 46(6):295-300, 1993.

Dynamic Interpolation Search in o(log log n) TimeArne Andersson, Christer Mattsson. icalp 1993: 15-27

Balanced Search Trees Made SimpleArne Andersson. wads 1993: 60-71

1992

Comments on On the Balance Property of Patricia Tries: External Path Length Viewpoint Arne Andersson. TCS, 106(2):391-393, 1992.

1991

Comparison-Efficient And Write-Optimal Searching and SortingArne Andersson, Tony W. Lai. sersc-isa 1991: 273-282

Faster Uniquely Represented DictionariesArne Andersson, Thomas Ottmann. focs 1991: 642-649

A Note on Searching in a Binary Search TreeArne Andersson. SPE, 21(10):1125-1128, 1991.

Maintaining α-balanced trees by partial rebuildingArne Andersson. ijcm, 38(1-2):37-48, 1991. [doi]

1990

Fast Updating of Well-Balanced TreesArne Andersson, Tony W. Lai. swat 1990: 111-121

Construction of a Tree From its Traversals in Optimal Time and SpaceArne Andersson, Svante Carlsson. ipl, 34(1):21-25, 1990.

Binary Search Trees of Almost Optimal HeightArne Andersson, Christian Icking, Rolf Klein, Thomas Ottmann. ACTA, 28(2):165-178, 1990.

A Note on the Expected Behaviour of Binary Tree TraversalsArne Andersson. cj, 33(5):471-472, 1990.

1989

Improving Partial Rebuilding by Using Simple Balance CriteriaArne Andersson. wads 1989: 393-402

Optimal Bounds on the Dictionary ProblemArne Andersson. oa 1989: 106-114

All Publications

Filter by Year
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1

Researchr

Publications by 'Arne Andersson'

Viewing Publication 1 - 57 from 57

2009

2007

2005

2003

2002

2001

2000

1999

1998

1997

1996

1995

1994

1993

1992

1991

1990

1989

All Publications

Filter by YearOR AND NOT 1

Filter by TypeOR AND NOT 1

Filter by TagOR AND NOT 1

Filter by Venue [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top Terms [+]OR AND NOT 1

Researchr

Publications by 'Arne Andersson'

Viewing Publication 1 - 57 from 57

2009

2007

2005

2003

2002

2001

2000

1999

1998

1997

1996

1995

1994

1993

1992

1991

1990

1989

Filter by Year
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1