Searching for authors named Arne Andersson – sorted by Relevance.
-
Maintaining alpha-balanced Trees by Partial Rebuilding
- Maintaining ff-balanced Trees by Partial Rebuilding Arne Andersson Department of Computer
- Add To MetaCart
-
Balanced search trees made simple
- Verlag, 1993. Balanced Search Trees Made Simple Arne Andersson ? Department of Computer Science, Lund
- Cited by 9 (0 self) – Add To MetaCart
-
General balanced trees
- :��www.idealibrary.com on General Balanced Trees Arne Andersson* Department of Computer Science, Lund Uni�ersity, Lund S221 00
- Cited by 9 (0 self) – Add To MetaCart
-
A Note on the Expected Behaviour of Binary Tree Traversals
- A Note on the Expected Behaviour of Binary Tree Traversals Arne Andersson Department of Computer
- Cited by 1 (0 self) – Add To MetaCart
-
Optimal Bounds on the Dictionary Problem
- Optimal Bounds on the Dictionary Problem Arne Andersson Department of Computer Science Lund
- Cited by 4 (1 self) – Add To MetaCart
-
Improving Partial Rebuilding by Using Simple Balance Criteria
- Improving Partial Rebuilding by Using Simple Balance Criteria Arne Andersson Department
- Cited by 18 (4 self) – Add To MetaCart
-
Fast updating of well-balanced trees
- Verlag, 1990. Fast Updating of Well-Balanced Trees Arne Andersson Lund University Sweden Tony W. Lai
- Cited by 11 (0 self) – Add To MetaCart
-
Faster Deterministic Sorting and Searching in Linear Space
- --CS--TR:95--160 Arne Andersson Department of Computer Science Lund University Box 118, S--221 00 Lund, Sweden
- Cited by 29 (6 self) – Add To MetaCart
-
Tight(er) worst-case bounds on dynamic searching and priority queues
- ABSTRACT Arne Andersson Computing Science Department Information Technology, Uppsala University Box 311, SE
- Cited by 32 (2 self) – Add To MetaCart
-
Sublogarithmic Searching Without Multiplications
- Sublogarithmic Searching Without Multiplications Arne Andersson Department of Computer Science
- Cited by 37 (11 self) – Add To MetaCart

