Arne Andersson

According to our database1, Arne Andersson
  • authored at least 58 papers between 1989 and 2009.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2009
A New Analysis of Expected Revenue.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

2007
Dynamic ordered sets with exponential search trees.
J. ACM, 2007

A flexible model for tree-structured multi-commodity markets.
Electronic Commerce Research, 2007

Market-Based Approaches to Optimization.
Computational Intelligence, 2007

Discovering Equilibrium Strategies for a Combinatorial First Price Auction.
Proceedings of the 9th IEEE International Conference on E-Commerce Technology (CEC 2007) / 4th IEEE International Conference on Enterprise Computing, 2007

2005
A Flexible Model for Tree-Structured Multi-commodity Markets.
Proceedings of the 7th IEEE International Conference on E-Commerce Technology (CEC 2005), 2005

An Auction Mechanism for Polynomial-Time Execution with Combinatorial Constraints.
Proceedings of the 7th IEEE International Conference on E-Commerce Technology (CEC 2005), 2005

2004
Balanced Binary Search Trees.
Proceedings of the Handbook of Data Structures and Applications., 2004

Searching and Priority Queues in o(log n) Time.
Proceedings of the Handbook of Data Structures and Applications., 2004

2003
A Tractable Mechanism for Time Dependent Markets.
Proceedings of the 2003 IEEE International Conference on Electronic Commerce (CEC 2003), 2003

Combinatorial Auctions, an Example of Algorithm Theory in Real Life.
Proceedings of the Computer Science in Perspective, Essays Dedicated to Thomas Ottmann, 2003

2002
Dynamic Ordered Sets with Exponential Search Trees
CoRR, 2002

Resource Allocation with Wobbly Functions.
Comp. Opt. and Appl., 2002

Caching in multi-unit combinatorial auctions.
Proceedings of the First International Joint Conference on Autonomous Agents & Multiagent Systems, 2002

2001
Extending Equilibrium Markets.
IEEE Intelligent Systems, 2001

Efficient Resource Allocation with Non-Concave Objective Functions.
Comp. Opt. and Appl., 2001

Efficient Resource Allocation with Noisy Functions.
Proceedings of the Algorithm Engineering, 2001

Dynamic string searching.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000
Tight Bounds for Searching a Sorted Array of Strings.
SIAM J. Comput., 2000

Tight(er) worst-case bounds on dynamic searching and priority queues.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Integer Programming for Combinatorial Auction Winner Determination.
Proceedings of the 4th International Conference on Multi-Agent Systems, 2000

1999
Fusion Trees can be Implemented with AC0 Instructions Only.
Theor. Comput. Sci., 1999

Measure-based classifier performance evaluation.
Pattern Recognition Letters, 1999

General Balanced Trees.
J. Algorithms, 1999

Suffix Trees on Words.
Algorithmica, 1999

1998
Implementing Radixsort.
ACM Journal of Experimental Algorithmics, 1998

Sorting in Linear Time?
J. Comput. Syst. Sci., 1998

Approximate Indexed Lists.
J. Algorithms, 1998

Managing Large Scale Computational Markets.
Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences, 1998

1997
On the Difficulty of Range Searching.
Comput. Geom., 1997

1996
Comments on Self-Indexed Sort.
SIGPLAN Notices, 1996

Sorting and Searching Revisted.
Proceedings of the Algorithm Theory, 1996

Static Dictionaries on AC0 RAMs: Query Time Theta(sqrt(log n/log log n)) is Necessary and Sufficient.
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

Faster Deterministic Sorting and Searching in Linear Space.
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

Suffix Trees on Words.
Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

1995
Efficient Implementation of Suffix Trees.
Softw., Pract. Exper., 1995

New Tight Bounds on Uniquely Represented Dictionaries.
SIAM J. Comput., 1995

On the Difficulty of Range Searching.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

A tight lower bound for searching a sorted array.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Sorting in linear time?
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

On-line Approximate List Indexing with Applications.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Sublogarithmic Searching without Multiplications.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994
The complexity of searching a sorted array of strings.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

A New Efficient Radix Sort
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

Faster Searching in Tries and Quadtrees - An Analysis of Level Compression.
Proceedings of the Algorithms, 1994

1993
Improved Behaviour of Tries by Adaptive Branching.
Inf. Process. Lett., 1993

Balanced Search Trees Made Simple.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Dynamic Interpolation Search in o(log log n) Time.
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".
Theor. Comput. Sci., 1992

1991
A Note on Searching in a Binary Search Tree.
Softw., Pract. Exper., 1991

Comparison-Efficient And Write-Optimal Searching and Sorting.
Proceedings of the ISA '91 Algorithms, 1991

Faster Uniquely Represented Dictionaries
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.
Inf. Process. Lett., 1990

A Note on the Expected Behaviour of Binary Tree Traversals.
Comput. J., 1990

Binary Search Trees of Almost Optimal Height.
Acta Inf., 1990

Fast Updating of Well-Balanced Trees.
Proceedings of the SWAT 90, 1990

1989
Improving Partial Rebuilding by Using Simple Balance Criteria.
Proceedings of the Algorithms and Data Structures, 1989

Optimal Bounds on the Dictionary Problem.
Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989


  Loading...