Log-logarithmic worst-case range queries are possible in space theta(N) (Q1838333)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Log-logarithmic worst-case range queries are possible in space theta(N) |
scientific article; zbMATH DE number 3804912
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Log-logarithmic worst-case range queries are possible in space theta(N) |
scientific article; zbMATH DE number 3804912 |
Statements
Log-logarithmic worst-case range queries are possible in space theta(N) (English)
0 references
1983
0 references
data structure
0 references
random access machine
0 references
priority queues
0 references
stratified trees
0 references
Van Emde Boas trees
0 references
sparse tables
0 references
special search algorithm of Fredmann, Komolos and Szemeredi
0 references
