The algorithm for identical object searching with bounded worst-case complexity and linear memory (Q341823): 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.1515/dma-2016-0024 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2555918239 / rank | |||
Normal rank | |||
Latest revision as of 21:14, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The algorithm for identical object searching with bounded worst-case complexity and linear memory |
scientific article |
Statements
The algorithm for identical object searching with bounded worst-case complexity and linear memory (English)
0 references
17 November 2016
0 references
key search
0 references
time complexity of algorithms
0 references
memory size
0 references
