Red-black trees with relative node keys (Q2252636): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2014.06.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2044719119 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Symmetric binary B-trees: Data structure and maintenance algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An axiomatic basis for computer programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2747613 / rank | |||
Normal rank | |||
Latest revision as of 18:16, 8 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Red-black trees with relative node keys |
scientific article |
Statements
Red-black trees with relative node keys (English)
0 references
18 July 2014
0 references
data structures
0 references
algorithms
0 references
search trees
0 references
red-black trees
0 references
relative keys
0 references
