Inherent complexity trade-offs for range query problems (Q1056239): 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/0304-3975(81)90099-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2021182002 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lower Bounds on the Complexity of Some Optimal Data Structures / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Complexity of Maintaining an Array and Computing Its Partial Sums / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Lower Bound on the Complexity of Orthogonal Range Queries / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some Monotonicity Properties of Partial Orders / rank | |||
Normal rank | |||
Latest revision as of 09:34, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inherent complexity trade-offs for range query problems |
scientific article |
Statements
Inherent complexity trade-offs for range query problems (English)
0 references
1981
0 references
range query problems
0 references
inherent trade-offs
0 references
average complexities
0 references
retrieve transactions
0 references
update transactions
0 references
