2020
DOI: 10.48550/arxiv.2010.08840
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Lazy Search Trees

Bryce Sandlund,
Sebastian Wild

Abstract: We introduce the lazy search tree data structure. The lazy search tree is a comparisonbased 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, change-key, split, and merge. We analyze the performance of our data structure based on a partition of current elements into a set of gaps {∆ i } based on rank. A query falls into a particular gap and splits the gap in… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 38 publications
(63 reference statements)
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?