Dynamization of decomposable searching problems yielding good worst-case bounds

Dynamization of decomposable searching problems yielding good worst-case bounds

A technique is described for dynamizing data structures of common types of decomposable searching problems, yielding good worst-case bounds rather than merely good average bounds on all operations to be performed on the resulting structures.

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Overmars, Mark H., van Leeuwen, Jan
Format: Buchkapitel
Sprache:eng
Schlagworte:
Binary Search Tree
Dynamic Structure
Insertion Time
Query Time
Static Structure
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A technique is described for dynamizing data structures of common types of decomposable searching problems, yielding good worst-case bounds rather than merely good average bounds on all operations to be performed on the resulting structures.
ISSN:0302-9743
1611-3349
DOI:10.1007/BFb0017314