Optimal dynamization of decomposable searching problems (Q1153688): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(81)90010-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2041883181 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decomposable searching problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Two general methods for dynamizing decomposable searching problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some principles for dynamizing decomposable searching problems / rank | |||
Normal rank | |||
Latest revision as of 12:34, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal dynamization of decomposable searching problems |
scientific article |
Statements
Optimal dynamization of decomposable searching problems (English)
0 references
1981
0 references
searching algorithms
0 references
automatic transformation of static data structures into dynamic data structures
0 references
