An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time (Q579942): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Self-Organizing Heuristics for Implicit Data Structures / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Recursively rotated orders and implicit data structures: A lower bound / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Implicit Data Structures for the Dictionary Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4656634 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Implicit data structures for fast search and update / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3673089 / rank | |||
Normal rank | |||
Latest revision as of 11:14, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time |
scientific article |
Statements
An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time (English)
0 references
1986
0 references
We introduce a data structure that requires only one pointer for every k data values and supports searches in O(log n) time and insertions and deletions in \(O(k+\log n)\) time. By choosing k to be O(log n), pointers can be encoded into the relative order of data values and this technique can be used to support insert, delete and search in \(O(\log^ 2 n)\) time while using only the storage needed for the data.
0 references
data structure
0 references
insertions
0 references
deletions
0 references
pointers
0 references
