Log-logarithmic worst-case range queries are possible in space theta(N) (Q1838333): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(83)90075-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2090021115 / rank | |||
Normal rank | |||
Revision as of 00:05, 20 March 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
