Please use this identifier to cite or link to this item: doi:10.22028/D291-26084
Title: Arbitrary weight changes in dynamic trees
Author(s): Mehlhorn, Kurt
Language: English
Year of Publication: 1978
OPUS Source: Saarbrücken, 1978
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: We describe an implementation of dynamic weighted trees, called D-trees. Given a set left{ B_{0},...,B_{n}right} of objects and access frequencies q_{0},q_{1},...,q_{n} one wants to store the objects in a binary tree such that average access is nearly optimal and changes of the access frequencies require only small changes of the tree. In D-trees the changes are always limited to the path of search and hence update time is at most proportional to search time.
Link to this record: urn:nbn:de:bsz:291-scidok-40406
Series name: Bericht / A / Fachbereich Angewandte Mathematik und Informatik, Universität des Saarlandes
Series volume: 1978/04
Date of registration: 27-Jul-2011
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_1978_04.pdf5,89 MBAdobe PDFView/Open

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