Persistente Suchbäume

The thesis describes how to achieve partial and full persitence for graph data structures of bounded degree. It describes and analyzes a randomized approach. Further it provides a framework for making C++ data structures partially persistent. The framework is used for constructing a partially persistent dictionary based on red-black trees, which is used for point location in planar subdivisions and voronoi diagrams