A log log n data structure for three-sided range queries (Q1108025): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(87)90174-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2081589479 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3219753 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Priority Search Trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3332263 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3992847 / rank | |||
Normal rank | |||
Latest revision as of 17:46, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A log log n data structure for three-sided range queries |
scientific article |
Statements
A log log n data structure for three-sided range queries (English)
0 references
1987
0 references
data structure
0 references
priority search tree
0 references
range search
0 references
lowest common ancestor
0 references
heap
0 references
