The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Arne Andersson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  52. A New Analysis of Expected Revenue. [Citation Graph (, )][DBLP]


  53. Market-Based Approaches to Optimization. [Citation Graph (, )][DBLP]


Search in 0.100secs, Finished in 0.102secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002