default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArne Andersson
Person information
- affiliation: Uppsala University, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[c32]Arne Andersson, Jim Wilenius:
A New Analysis of Expected Revenue. SOFSEM 2009: 1-2- 2007
- [j25]Maria Karlsson, Fredrik Ygge, Arne Andersson:
Market-Based Approaches to Optimization. Comput. Intell. 23(1): 92-109 (2007) - [j24]Per Carlsson, Arne Andersson:
A flexible model for tree-structured multi-commodity markets. Electron. Commer. Res. 7(1): 69-88 (2007) - [j23]Arne Andersson, Mikkel Thorup:
Dynamic ordered sets with exponential search trees. J. ACM 54(3): 13 (2007) - [c31]Jim Wilenius, Arne Andersson:
Discovering Equilibrium Strategies for a Combinatorial First Price Auction. CEC/EEE 2007: 13-20 - 2005
- [c30]Arne Andersson, Jim Holmstrom, Mattias Willman:
An Auction Mechanism for Polynomial-Time Execution with Combinatorial Constraints. CEC 2005: 17-24 - [c29]Per Carlsson, Arne Andersson:
A Flexible Model for Tree-Structured Multi-commodity Markets. CEC 2005: 50-57 - 2004
- [r2]Arne Andersson:
Searching and Priority Queues in o(log n) Time. Handbook of Data Structures and Applications 2004 - [r1]Arne Andersson, Rolf Fagerberg, Kim S. Larsen:
Balanced Binary Search Trees. Handbook of Data Structures and Applications 2004 - 2003
- [c28]Arne Andersson:
Combinatorial Auctions, an Example of Algorithm Theory in Real Life. Computer Science in Perspective 2003: 13-21 - [c27]Per Carlsson, Arne Andersson, Fredrik Ygge:
A Tractable Mechanism for Time Dependent Markets. CEC 2003: 31-34 - 2002
- [j22]Arne Andersson, Per Carlsson, Fredrik Ygge:
Resource Allocation with Wobbly Functions. Comput. Optim. Appl. 23(2): 171-200 (2002) - [c26]Kidane Asrat Ghebreamiak, Arne Andersson:
Caching in multi-unit combinatorial auctions. AAMAS 2002: 164-165 - [i1]Arne Andersson, Mikkel Thorup:
Dynamic Ordered Sets with Exponential Search Trees. CoRR cs.DS/0210006 (2002) - 2001
- [j21]Arne Andersson, Fredrik Ygge:
Efficient Resource Allocation with Non-Concave Objective Functions. Comput. Optim. Appl. 20(3): 281-298 (2001) - [j20]Per Carlsson, Fredrik Ygge, Arne Andersson:
Extending Equilibrium Markets. IEEE Intell. Syst. 16(4): 18-26 (2001) - [c25]Arne Andersson, Mikkel Thorup:
Dynamic string searching. SODA 2001: 307-308 - [c24]Arne Andersson, Per Carlsson, Fredrik Ygge:
Efficient Resource Allocation with Noisy Functions. WAE 2001: 91-105 - 2000
- [j19]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) - [c23]Arne Andersson, Mattias Tenhunen, Fredrik Ygge:
Integer Programming for Combinatorial Auction Winner Determination. ICMAS 2000: 39-46 - [c22]Arne Andersson, Mikkel Thorup:
Tight(er) worst-case bounds on dynamic searching and priority queues. STOC 2000: 335-342
1990 – 1999
- 1999
- [j18]Arne Andersson, N. Jesper Larsson, Kurt Swanson:
Suffix Trees on Words. Algorithmica 23(3): 246-260 (1999) - [j17]Arne Andersson:
General Balanced Trees. J. Algorithms 30(1): 1-18 (1999) - [j16]Arne Andersson, Paul Davidsson, Johan Lindén:
Measure-based classifier performance evaluation. Pattern Recognit. Lett. 20(11-13): 1165-1173 (1999) - [j15]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
- [j14]Arne Andersson, Ola Petersson:
Approximate Indexed Lists. J. Algorithms 29(2): 256-276 (1998) - [j13]Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman:
Sorting in Linear Time? J. Comput. Syst. Sci. 57(1): 74-93 (1998) - [j12]Arne Andersson, Stefan Nilsson:
Implementing Radixsort. ACM J. Exp. Algorithmics 3: 7 (1998) - [c21]Arne Andersson, Fredrik Ygge:
Managing Large Scale Computational Markets. HICSS (7) 1998: 4-13 - 1997
- [j11]Arne Andersson, Kurt Swanson:
On the Difficulty of Range Searching. Comput. Geom. 8: 115-122 (1997) - [c20]Arne Andersson, Stefan Nilsson:
Implementing Radixsort. WAE 1997: 156-165 - 1996
- [j10]Arne Andersson, Andrej Brodnik:
Comments on Self-Indexed Sort. ACM SIGPLAN Notices 31(8): 40-41 (1996) - [c19]Arne Andersson, N. Jesper Larsson, Kurt Swanson:
Suffix Trees on Words. CPM 1996: 102-115 - [c18]Arne Andersson:
Faster Deterministic Sorting and Searching in Linear Space. FOCS 1996: 135-141 - [c17]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 - [c16]Arne Andersson:
Sorting and Searching Revisted. SWAT 1996: 185-197 - 1995
- [j9]Arne Andersson, Thomas Ottmann:
New Tight Bounds on Uniquely Represented Dictionaries. SIAM J. Comput. 24(5): 1091-1101 (1995) - [j8]Arne Andersson, Stefan Nilsson:
Efficient Implementation of Suffix Trees. Softw. Pract. Exp. 25(2): 129-141 (1995) - [c15]Arne Andersson:
Sublogarithmic Searching without Multiplications. FOCS 1995: 655-663 - [c14]Arne Andersson, Ola Petersson:
On-line Approximate List Indexing with Applications. SODA 1995: 20-27 - [c13]Arne Andersson, Johan Håstad, Ola Petersson:
A tight lower bound for searching a sorted array. STOC 1995: 417-426 - [c12]Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman:
Sorting in linear time? STOC 1995: 427-436 - [c11]Arne Andersson, Kurt Swanson:
On the Difficulty of Range Searching. WADS 1995: 473-481 - 1994
- [c10]Arne Andersson, Stefan Nilsson:
Faster Searching in Tries and Quadtrees - An Analysis of Level Compression. ESA 1994: 82-93 - [c9]Arne Andersson, Stefan Nilsson:
A New Efficient Radix Sort. FOCS 1994: 714-721 - [c8]Arne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson:
The complexity of searching a sorted array of strings. STOC 1994: 317-325 - 1993
- [j7]Arne Andersson, Stefan Nilsson:
Improved Behaviour of Tries by Adaptive Branching. Inf. Process. Lett. 46(6): 295-300 (1993) - [c7]Arne Andersson, Christer Mattsson:
Dynamic Interpolation Search in o(log log n) Time. ICALP 1993: 15-27 - [c6]Arne Andersson:
Balanced Search Trees Made Simple. WADS 1993: 60-71 - 1992
- [j6]Arne Andersson:
Comments on "On the Balance Property of Patricia Tries: External Path Length Viewpoint". Theor. Comput. Sci. 106(2): 391-393 (1992) - 1991
- [j5]Arne Andersson:
Maintaining α-balanced trees by partial rebuilding. Int. J. Comput. Math. 38(1-2): 37-48 (1991) - [j4]Arne Andersson:
A Note on Searching in a Binary Search Tree. Softw. Pract. Exp. 21(10): 1125-1128 (1991) - [c5]Arne Andersson, Thomas Ottmann:
Faster Uniquely Represented Dictionaries. FOCS 1991: 642-649 - [c4]Arne Andersson, Tony W. Lai:
Comparison-Efficient And Write-Optimal Searching and Sorting. ISA 1991: 273-282 - 1990
- [j3]Arne Andersson, Christian Icking, Rolf Klein, Thomas Ottmann:
Binary Search Trees of Almost Optimal Height. Acta Informatica 28(2): 165-178 (1990) - [j2]Arne Andersson:
A Note on the Expected Behaviour of Binary Tree Traversals. Comput. J. 33(5): 471-472 (1990) - [j1]Arne Andersson, Svante Carlsson:
Construction of a Tree From its Traversals in Optimal Time and Space. Inf. Process. Lett. 34(1): 21-25 (1990) - [c3]Arne Andersson, Tony W. Lai:
Fast Updating of Well-Balanced Trees. SWAT 1990: 111-121
1980 – 1989
- 1989
- [c2]Arne Andersson:
Optimal Bounds on the Dictionary Problem. Optimal Algorithms 1989: 106-114 - [c1]Arne Andersson:
Improving Partial Rebuilding by Using Simple Balance Criteria. WADS 1989: 393-402
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
