Searching for authors named "Sabine Hanke" – sorted by Relevance.
3 documents found, showing 1 through 3.
-
Chromatic Search Trees Revisited
- …Relaxed balancing of search trees was introduced with the aim of speeding up the updates and allowing a high degree of concurrency. In a relaxed version of a search tree the rebalancing operations are uncoupled from the updates and may be delayed. Using local transformations the rebalancing can be p…
- Cited by 1 (1 self) – Add To MetaCart
-
The Performance of Concurrent Red-Black Tree Algorithms
- …Relaxed balancing has become a commonly used concept in the design of concurrent search tree algorithms. The idea of relaxed balancing is to uncouple the rebalancing from the updating in order to speed up the update operations and to allow a high degree of concurrency. Many different relaxed bala…
- Cited by 7 (0 self) – Add To MetaCart
-
The Edge-flipping Distance of Triangulations
- …An edge-flipping operation in a triangulation T of a set of points in the plane is a local restructuring that changes T into a triangulation that differs from T in exactly one edge. The edge-flipping distance between two triangulations of the same set of points is the minimum number of edge-flippin…
- Cited by 12 (0 self) – Add To MetaCart
Showing 1 through 3.
