Two general methods for dynamizing decomposable searching problems (Q1149778): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Decomposable searching problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Multidimensional binary search trees used for associative searching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4181286 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maintenance of configurations in the plane / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02241781 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1595672100 / rank | |||
Normal rank | |||
Latest revision as of 10:59, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two general methods for dynamizing decomposable searching problems |
scientific article |
Statements
Two general methods for dynamizing decomposable searching problems (English)
0 references
1981
0 references
insertions
0 references
deletions
0 references
merge technique
0 references
quad-trees
0 references
intersection of halfspaces
0 references
