Lazy Search Trees

We introduce the lazy search tree data structure. The lazy search tree is a comparison-based data structure on the pointer machine that supports order-based operations such as rank, select, membership, predecessor, successor, minimum, and maximum while providing dynamic operations insert, delete, ch...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2020-10
Hauptverfasser:	Sandlund, Bryce, Wild, Sebastian
Format:	Artikel
Sprache:	eng
Schlagworte:	Data search Data structures Direct reduction Lower bounds Nonuniformity Queries Queues Supports Trees
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!