Arne Andersson

60 papers A* 12A 2B 8Journal 26Unranked 10

Year	Rank	Type	Title / Venue / Authors
2009	B	`conf`	A New Analysis of Expected Revenue. SOFSEM Arne Andersson, Jim Wilenius
2007	J	`jnl`	A flexible model for tree-structured multi-commodity markets. Electron. Commer. Res. Per Carlsson, Arne Andersson
2007	—	`conf`	Discovering Equilibrium Strategies for a Combinatorial First Price Auction. CEC/EEE Jim Wilenius, Arne Andersson
2007	J	`jnl`	Dynamic ordered sets with exponential search trees. J. ACM Arne Andersson, Mikkel Thorup
2007	J	`jnl`	Market-Based Approaches to Optimization. Comput. Intell. Maria Karlsson, Fredrik Ygge, Arne Andersson
2005	B	`conf`	A Flexible Model for Tree-Structured Multi-commodity Markets. CEC Per Carlsson, Arne Andersson
2005	B	`conf`	An Auction Mechanism for Polynomial-Time Execution with Combinatorial Constraints. CEC Arne Andersson, Jim Holmstrom, Mattias Willman
2004	—	`ch.`	Balanced Binary Search Trees. Handbook of Data Structures and Applications Arne Andersson, Rolf Fagerberg, Kim S. Larsen
2004	—	`ch.`	Searching and Priority Queues in o(log n) Time. Handbook of Data Structures and Applications Arne Andersson
2003	B	`conf`	A Tractable Mechanism for Time Dependent Markets. CEC Per Carlsson, Arne Andersson, Fredrik Ygge
2003	—	`conf`	Combinatorial Auctions, an Example of Algorithm Theory in Real Life. Computer Science in Perspective Arne Andersson
2002	A	`conf`	Caching in multi-unit combinatorial auctions. AAMAS Kidane Asrat Ghebreamiak, Arne Andersson
2002	J	`jnl`	Dynamic Ordered Sets with Exponential Search Trees CoRR Arne Andersson, Mikkel Thorup
2002	J	`jnl`	Resource Allocation with Wobbly Functions. Comput. Optim. Appl. Arne Andersson, Per Carlsson, Fredrik Ygge
2001	A*	`conf`	Dynamic string searching. SODA Arne Andersson, Mikkel Thorup
2001	—	`conf`	Efficient Resource Allocation with Noisy Functions. WAE Arne Andersson, Per Carlsson, Fredrik Ygge
2001	J	`jnl`	Efficient Resource Allocation with Non-Concave Objective Functions. Comput. Optim. Appl. Arne Andersson, Fredrik Ygge
2001	J	`jnl`	Extending Equilibrium Markets. IEEE Intell. Syst. Per Carlsson, Fredrik Ygge, Arne Andersson
2000	—	`conf`	Integer Programming for Combinatorial Auction Winner Determination. ICMAS Arne Andersson, Mattias Tenhunen, Fredrik Ygge
2000	J	`jnl`	Tight Bounds for Searching a Sorted Array of Strings. SIAM J. Comput. Arne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson
2000	A*	`conf`	Tight(er) worst-case bounds on dynamic searching and priority queues. STOC Arne Andersson, Mikkel Thorup
1999	J	`jnl`	Fusion Trees can be Implemented with AC Theor. Comput. Sci. Arne Andersson, Peter Bro Miltersen, Mikkel Thorup
1999	J	`jnl`	General Balanced Trees. J. Algorithms Arne Andersson
1999	J	`jnl`	Measure-based classifier performance evaluation. Pattern Recognit. Lett. Arne Andersson, Paul Davidsson, Johan Lindén
1999	J	`jnl`	Suffix Trees on Words. Algorithmica Arne Andersson, N. Jesper Larsson, Kurt Swanson
1998	J	`jnl`	Approximate Indexed Lists. J. Algorithms Arne Andersson, Ola Petersson
1998	J	`jnl`	Implementing Radixsort. ACM J. Exp. Algorithmics Arne Andersson, Stefan Nilsson
1998	—	`conf`	Managing Large Scale Computational Markets. HICSS (7) Arne Andersson, Fredrik Ygge
1998	J	`jnl`	Sorting in Linear Time? J. Comput. Syst. Sci. Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman
1997	—	`conf`	Implementing Radixsort. WAE Arne Andersson, Stefan Nilsson
1997	J	`jnl`	On the Difficulty of Range Searching. Comput. Geom. Arne Andersson, Kurt Swanson
1996	J	`jnl`	Comments on Self-Indexed Sort. ACM SIGPLAN Notices Arne Andersson, Andrej Brodnik
1996	A*	`conf`	Faster Deterministic Sorting and Searching in Linear Space. FOCS Arne Andersson
1996	—	`conf`	Sorting and Searching Revisted. SWAT Arne Andersson
1996	A*	`conf`	Static Dictionaries on AC FOCS Arne Andersson, Peter Bro Miltersen, Søren Riis, Mikkel Thorup
1996	B	`conf`	Suffix Trees on Words. CPM Arne Andersson, N. Jesper Larsson, Kurt Swanson
1995	A*	`conf`	A tight lower bound for searching a sorted array. STOC Arne Andersson, Johan Håstad, Ola Petersson
1995	J	`jnl`	Efficient Implementation of Suffix Trees. Softw. Pract. Exp. Arne Andersson, Stefan Nilsson
1995	J	`jnl`	New Tight Bounds on Uniquely Represented Dictionaries. SIAM J. Comput. Arne Andersson, Thomas Ottmann
1995	B	`conf`	On the Difficulty of Range Searching. WADS Arne Andersson, Kurt Swanson
1995	A*	`conf`	On-line Approximate List Indexing with Applications. SODA Arne Andersson, Ola Petersson
1995	A*	`conf`	Sorting in linear time? STOC Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman
1995	A*	`conf`	Sublogarithmic Searching without Multiplications. FOCS Arne Andersson
1994	A*	`conf`	A New Efficient Radix Sort FOCS Arne Andersson, Stefan Nilsson
1994	A	`conf`	Faster Searching in Tries and Quadtrees - An Analysis of Level Compression. ESA Arne Andersson, Stefan Nilsson
1994	A*	`conf`	The complexity of searching a sorted array of strings. STOC Arne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson
1993	B	`conf`	Balanced Search Trees Made Simple. WADS Arne Andersson
1993	A*	`conf`	Dynamic Interpolation Search in o(log log n) Time. ICALP Arne Andersson, Christer Mattsson
1993	J	`jnl`	Improved Behaviour of Tries by Adaptive Branching. Inf. Process. Lett. Arne Andersson, Stefan Nilsson
1992	J	`jnl`	Comments on "On the Balance Property of Patricia Tries: External Path Length Viewpoint". Theor. Comput. Sci. Arne Andersson
1991	J	`jnl`	A Note on Searching in a Binary Search Tree. Softw. Pract. Exp. Arne Andersson
1991	—	`conf`	Comparison-Efficient And Write-Optimal Searching and Sorting. ISA Arne Andersson, Tony W. Lai
1991	A*	`conf`	Faster Uniquely Represented Dictionaries FOCS Arne Andersson, Thomas Ottmann
1991	J	`jnl`	Maintaining α-balanced trees by partial rebuilding. Int. J. Comput. Math. Arne Andersson
1990	J	`jnl`	A Note on the Expected Behaviour of Binary Tree Traversals. Comput. J. Arne Andersson
1990	J	`jnl`	Binary Search Trees of Almost Optimal Height. Acta Informatica Arne Andersson, Christian Icking, Rolf Klein, Thomas Ottmann
1990	J	`jnl`	Construction of a Tree From its Traversals in Optimal Time and Space. Inf. Process. Lett. Arne Andersson, Svante Carlsson
1990	—	`conf`	Fast Updating of Well-Balanced Trees. SWAT Arne Andersson, Tony W. Lai
1989	B	`conf`	Improving Partial Rebuilding by Using Simple Balance Criteria. WADS Arne Andersson
1989	—	`conf`	Optimal Bounds on the Dictionary Problem. Optimal Algorithms Arne Andersson