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

DOI10.1515/DMA-2016-0024zbMATH Open1392.68161OpenAlexW2555918239MaRDI QIDQ341823FDOQ341823

A. 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

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

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)

Cites Work

• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• A constant, in the worst case, algorithm to search for identical objects
• Title not available (Why is that?)

Cited In (1)

• A constant, in the worst case, algorithm to search for identical objects

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)