Sciweavers

234 search results - page 8 / 47
» An Introduction to Binary Search Trees and Balanced Trees
Sort
View
IPL
2002
119views more  IPL 2002»
14 years 9 months ago
Randomized splay trees: Theoretical and experimental results
Splay trees are self-organizing binary search trees that were introduced by Sleator and Tarjan [12]. In this paper we present a randomized variant of these trees. The new algorith...
Susanne Albers, Marek Karpinski
FSTTCS
2004
Springer
15 years 3 months ago
Approximate Range Searching Using Binary Space Partitions
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
Mark de Berg, Micha Streppel
IUI
2009
ACM
15 years 6 months ago
Searching large indexes on tiny devices: optimizing binary search with character pinning
The small physical size of mobile devices imposes dramatic restrictions on the user interface (UI). With the ever increasing capacity of these devices as well as access to large o...
Guy Shani, Christopher Meek, Tim Paek, Bo Thiesson...
DMTCS
2002
108views Mathematics» more  DMTCS 2002»
14 years 9 months ago
The height of q-Binary Search Trees
Abstract. q
Michael Drmota, Helmut Prodinger
WADS
1993
Springer
136views Algorithms» more  WADS 1993»
15 years 1 months ago
Balanced Search Trees Made Simple
Abstract. As a contribution to the recent debate on simple implementations of dictionaries, we present new maintenancealgorithms for balanced trees. In terms of code simplicity, ou...
Arne Andersson