Please use this identifier to cite or link to this item: doi:10.22028/D291-26455
Title: Using persistent data structures for adding range restrictions to searching problems
Author(s): Lenhof, Hans-Peter
Smid, Michiel
Language: English
Year of Publication: 1990
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: The problem of adding range restrictions to decomposable searching problems is considered. First, a general technique is given that makes an arbitrary dynamic data structure partially persistent. Then, a general technique is given that transforms a partially persistent data structure that solves a decomposable searching problem into a structure or the same problem with added range restrictions. Applying the general technique to specific searching problems gives efficient data structures, especially in case more than one range restriction, one of which has constant width, is added.
Link to this record: urn:nbn:de:bsz:291-scidok-51475
Series name: Technischer Bericht / A / Fachbereich Informatik, Universität des Saarlandes
Series volume: 1990/22
Date of registration: 4-Apr-2013
Faculty: MI - Fakultät für Mathematik und Informatik
Department: MI - Informatik
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
fb14_1990_22.pdf25,27 MBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.