Persistente Suchbäume

Thiel, Sven

Local TagsRelease HistoryDetailsSummary

Persistente Suchbäume

Thiel, S. (1999). Persistente Suchbäume. Master Thesis, Universität des Saarlandes, Saarbrücken.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-35FB-9 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-A74E-5

Genre: Thesis

Files

show Files

hide Files

:

diplom.ps.gz (Any fulltext), 431KB

File Permalink:
-

Name:
diplom.ps.gz

Description:
-

OA-Status:

Visibility:
Private

MIME-Type / Checksum:
application/gzip

Technical Metadata:

Copyright Date:
-

Copyright Info:
-

License:
-

Locators

show

Creators

show

hide

Creators:
Thiel, Sven¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

hide

Free keywords: -

Abstract: 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.

Details

show

hide

Language(s): deu - German

Dates: Modified: 2010-03-02Accepted: 1999Date issued: 1999

Publication Status: Issued

Pages: -

Publishing info: Saarbrücken : Universität des Saarlandes

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 518043
Other: Local-ID: C1256428004B93B8-AEB663B34A001FCCC125688D0032369B-ThielMasterThesis99

Degree: Master

Event

show

Legal Case

show

Project information

show

Source

show