The algorithm for identical object searching with bounded worst-case complexity and linear memory

DOI10.1515/dma-2016-0024zbMath1392.68161OpenAlexW2555918239MaRDI QIDQ341823

Andrey M. Zubkov, Natalia V. Klykova, El'yar E. Gasanov

Publication date: 17 November 2016

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2016-0024

zbMATH Keywords

key searchmemory sizetime complexity of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Database theory (68P15)

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solution of the problem of the optimal synthesis of information graphs for basic information search problems.
• Lower bounds of temporal and spatial complexity of the substring search problem
• Deterministic Dictionaries
• Structure and Use of ALGOL 60
• A constant, in the worst case, algorithm to search for identical objects