Log-logarithmic worst-case range queries are possible in space theta(N) (Q1838333): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q61051151, #quickstatements; #temporary_batch_1704605156744 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q61051151 / rank | |||
Normal rank | |||
Revision as of 06:30, 7 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Log-logarithmic worst-case range queries are possible in space theta(N) |
scientific article |
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
