Skip trees, an alternative data structure to skip lists in a concurrent approach (Q4361577): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1051/ita/1997310302511 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1051/ITA/1997310302511 / rank | |||
Normal rank | |||
Latest revision as of 21:32, 29 December 2024
scientific article; zbMATH DE number 1080090
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Skip trees, an alternative data structure to skip lists in a concurrent approach |
scientific article; zbMATH DE number 1080090 |
Statements
Skip trees, an alternative data structure to skip lists in a concurrent approach (English)
0 references
11 June 1998
0 references
Skip trees
0 references
Skip lists
0 references
sequential update algorithms
0 references
B-trees
0 references
0 references
