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

DOI10.1515/DMA-2016-0024MaRDI QIDQ341823zbMATHOpenAlexFDO

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

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)

Recommendations

• A constant, in the worst case, algorithm to search for identical objects
• An O(n+k) algorithm for ordered retrieval from an associative memory
• Average complexity of searching for identical objects in random nonuniform databases
• A linear in memory non-exhaustive algorithm to solve a two-dimensional interval search problem
• The family of algorithms LOKATOR for fast search of the closest analogue

Cites work

• scientific article; zbMATH DE number 3471582 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 1305431 (Why is no real title available?)
• scientific article; zbMATH DE number 1889083 (Why is no real title available?)
• A constant, in the worst case, algorithm to search for identical objects
• Deterministic dictionaries
• Lower bounds of temporal and spatial complexity of the substring search problem
• Solution of the problem of the optimal synthesis of information graphs for basic information search problems.
• Structure and Use of ALGOL 60

Cited in

(2)

• A constant, in the worst case, algorithm to search for identical objects
• Average complexity of searching for identical objects in random nonuniform databases

Describes a project that uses

Uses Software

• ALGOL 60

This page was built for publication: The algorithm for identical object searching with bounded worst-case complexity and linear memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q341823)