|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 42 occurrences of 27 keywords
|
|
|
|
|
Results
Found 53 publication records. Showing 53 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Arne Andersson, Jim Wilenius |
A New Analysis of Expected Revenue.  |
SOFSEM  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson, Mikkel Thorup |
Dynamic ordered sets with exponential search trees. |
J. ACM |
2007 |
DBLP DOI BibTeX RDF |
ordered lists, Search trees |
| 1 | Per Carlsson, Arne Andersson |
A flexible model for tree-structured multi-commodity markets. |
Electronic Commerce Research |
2007 |
DBLP DOI BibTeX RDF |
Multi commodity markets, Equilibrium markets, Bandwidth markets, Computational complexity, Resource allocation, Electronic markets, Power markets, Computational markets |
| 1 | Maria Karlsson, Fredrik Ygge, Arne Andersson |
Market-Based Approaches to Optimization. |
Computational Intelligence |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jim Wilenius, Arne Andersson |
Discovering Equilibrium Strategies for a Combinatorial First Price Auction. |
CEC/EEE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Per Carlsson, Arne Andersson |
A Flexible Model for Tree-Structured Multi-commodity Markets. |
CEC |
2005 |
DBLP DOI BibTeX RDF |
multi commodity markets, equilibrium markets, bandwidth markets, computational complexity, resource allocation, electronic markets, power markets, computational markets |
| 1 | Arne Andersson, Jim Holmstrom, Mattias Willman |
An Auction Mechanism for Polynomial-Time Execution with Combinatorial Constraints. |
CEC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson |
Combinatorial Auctions, an Example of Algorithm Theory in Real Life. |
Computer Science in Perspective |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Per Carlsson, Arne Andersson, Fredrik Ygge |
A Tractable Mechanism for Time Dependent Markets. |
CEC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson, Mikkel Thorup |
Dynamic Ordered Sets with Exponential Search Trees |
CoRR |
2002 |
DBLP BibTeX RDF |
|
| 1 | Kidane Asrat Ghebreamiak, Arne Andersson |
Caching in multi-unit combinatorial auctions. |
AAMAS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Per Carlsson, Fredrik Ygge, Arne Andersson |
Extending Equilibrium Markets. |
IEEE Intelligent Systems |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson, Mikkel Thorup |
Dynamic string searching. |
SODA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson, Per Carlsson, Fredrik Ygge |
Efficient Resource Allocation with Noisy Functions. |
Algorithm Engineering |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson |
Tight Bounds for Searching a Sorted Array of Strings. |
SIAM J. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson, Mattias Tenhunen, Fredrik Ygge |
Integer Programming for Combinatorial Auction Winner Determination. |
ICMAS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson, Mikkel Thorup |
Tight(er) worst-case bounds on dynamic searching and priority queues. |
STOC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson, Peter Bro Miltersen, Mikkel Thorup |
Fusion Trees can be Implemented with AC0 Instructions Only. |
Theor. Comput. Sci. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson, N. Jesper Larsson, Kurt Swanson |
Suffix Trees on Words. |
Algorithmica |
1999 |
DBLP DOI BibTeX RDF |
Substring searching, Suffix trees |
| 1 | Arne Andersson |
General Balanced Trees. |
J. Algorithms |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson, Paul Davidsson, Johan Lindén |
Measure-based classifier performance evaluation. |
Pattern Recognition Letters |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson, Ola Petersson |
Approximate Indexed Lists. |
J. Algorithms |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman |
Sorting in Linear Time? |
J. Comput. Syst. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson, Stefan Nilsson |
Implementing Radixsort. |
ACM Journal of Experimental Algorithmics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson, Kurt Swanson |
On the Difficulty of Range Searching. |
Comput. Geom. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson, Andrej Brodnik |
Comments on Self-Indexed Sort. |
SIGPLAN Notices |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson |
Sorting and Searching Revisted. |
SWAT |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson, N. Jesper Larsson, Kurt Swanson |
Suffix Trees on Words. |
CPM |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson |
Faster Deterministic Sorting and Searching in Linear Space. |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
deterministic sorting, unit-cost RAM, member search, neighbour search, fusion trees, complexity, data structure, searching, sorting, insert, delete, worst-case, perfect hashing, linear space |
| 1 | Arne Andersson, Stefan Nilsson |
Efficient Implementation of Suffix Trees. |
Softw., Pract. Exper. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson, Thomas Ottmann |
New Tight Bounds on Uniquely Represented Dictionaries. |
SIAM J. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson, Ola Petersson |
On-line Approximate List Indexing with Applications. |
SODA |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson, Kurt Swanson |
On the Difficulty of Range Searching. |
WADS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson |
Sublogarithmic Searching without Multiplications. |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
sublogarithmic searching, unit-cost RAM, computational complexity, data structure, search, search problems, tree data structures, insert, delete, nearest neighbour, worst-case time |
| 1 | Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman |
Sorting in linear time? |
STOC |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson, Johan Håstad, Ola Petersson |
A tight lower bound for searching a sorted array. |
STOC |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson, Stefan Nilsson |
Faster Searching in Tries and Quadtrees - An Analysis of Level Compression. |
ESA |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson, Stefan Nilsson |
A New Efficient Radix Sort |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
Forward Radix Sort, preprocessing step, stationary ergodic process, complexity, entropy, radix sort, sorting problem |
| 1 | Arne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson |
The complexity of searching a sorted array of strings. |
STOC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson, Stefan Nilsson |
Improved Behaviour of Tries by Adaptive Branching. |
Inf. Process. Lett. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson, Christer Mattsson |
Dynamic Interpolation Search in o(log log n) Time. |
ICALP |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson |
Balanced Search Trees Made Simple. |
WADS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson |
Comments on "On the Balance Property of Patricia Tries: External Path Length Viewpoint". |
Theor. Comput. Sci. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson |
A Note on Searching in a Binary Search Tree. |
Softw., Pract. Exper. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson, Tony W. Lai |
Comparison-Efficient And Write-Optimal Searching and Sorting. |
ISA |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson, Thomas Ottmann |
Faster Uniquely Represented Dictionaries |
FOCS |
1991 |
DBLP DOI BibTeX RDF |
bounded outdegree graph, ordered universe, search, lower bound, update, insert, delete, binary search tree, worst case, dictionary problem |
| 1 | Arne Andersson, Svante Carlsson |
Construction of a Tree From its Traversals in Optimal Time and Space. |
Inf. Process. Lett. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson, Christian Icking, Rolf Klein, Thomas Ottmann |
Binary Search Trees of Almost Optimal Height. |
Acta Inf. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson |
A Note on the Expected Behaviour of Binary Tree Traversals. |
Comput. J. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson, Tony W. Lai |
Fast Updating of Well-Balanced Trees. |
SWAT |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson |
Optimal Bounds on the Dictionary Problem. |
Optimal Algorithms |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Andersson |
Improving Partial Rebuilding by Using Simple Balance Criteria. |
WADS |
1989 |
DBLP BibTeX RDF |
|
Displaying result #1 - #53 of 53 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")