Publications
Thesis (Server domino.mpi-inf.mpg.de)
Thesis
Master's thesis | @MastersThesis{ThielMasterThesis99, ... | Masterarbeit - German
Thiel, Sven
Persistente Suchbäume
Universität des Saarlandes, May, 1999
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.
Persistence, Persistent data structures, Point location
Mehlhorn, Kurt
Seidel, Raimund
Mehlhorn, Kurt
Completed
20
January
2021
Max-Planck-Institut für Informatik
Algorithms and Complexity Group
experts only
MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat
BibTeX Entry:
@MASTERSTHESIS{ThielMasterThesis99,
AUTHOR = {Thiel, Sven},
TITLE = {Persistente Suchb{\"a}ume},
SCHOOL = {Universit{\"a}t des Saarlandes},
YEAR = {1999},
TYPE = {Master's thesis}
MONTH = {May},
}
AUTHOR = {Thiel, Sven},
TITLE = {Persistente Suchb{\"a}ume},
SCHOOL = {Universit{\"a}t des Saarlandes},
YEAR = {1999},
TYPE = {Master's thesis}
MONTH = {May},
}
Entry last modified by Sven Thiel, 03/02/2010
Edit History (please click the blue arrow to see the details) | Editor(s) Sven Thiel | Created 02/22/2000 10:08:27 AM |
| Revisions 3. 2. 1. 0. | Editor(s) Sven Thiel Sven Thiel Sven Thiel Sven Thiel | Edit Dates 22/02/2000 10:18:15 22/02/2000 10:16:46 22/02/2000 10:14:56 22/02/2000 10:08:31 |