Please use this identifier to cite or link to this item: doi:10.22028/D291-26120
Title: Dynamic deferred data structuring
Author(s): Ching, Y. T.
Mehlhorn, Kurt
Language: English
Year of Publication: 1988
OPUS Source: Saarbrücken, 1988
Free key words: dictionary problem
weight-balanced trees
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: Let S be a set of n reals. We show how to process on-line r membership queries, insertions, and deletions in time O(r log (n + r) + (n + r) log r). This is optimal in the binary comparison model.
Link to this record: urn:nbn:de:bsz:291-scidok-41652
Series name: Technischer Bericht / A / Fachbereich Informatik, Universität des Saarlandes
Series volume: 1988/05
Date of registration: 5-Sep-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_1988_05.pdf1,08 MBAdobe PDFView/Open

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