On a one-dimensional interval search problem

DOI10.1515/DMA.1995.5.2.117MaRDI QIDQ4856881zbMATH OpenOpenAlexFDO

Authors El'yar E. Gasanov

Publication date 28 January 1996

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

Full work available at URL https://doi.org/10.1515/dma.1995.5.2.117

zbMATH Keywords

information network with switches

Mathematics Subject Classification ID

Searching and sorting (68P10) Information storage and retrieval of data (68P20)

Recommendations

• scientific article; zbMATH DE number 647637
• A linear in memory non-exhaustive algorithm to solve a two-dimensional interval search problem
• A lower bound for the complexity of information networks for one partial order relation
• The Shannon function of the complexity of interval search on the Boolean cube in the class of trees
• Dichotomous Search for Random Objects on an Interval

Cited in

(5)

• Information storage and search complexity theory
• A linear in memory non-exhaustive algorithm to solve a two-dimensional interval search problem
• scientific article; zbMATH DE number 647637 (Why is no real title available?)
• On the functional complexity of a two-dimensional interval search problem
• A criterion for reducibility of the problem on dangerous closeness to one-dimensional interval search

This page was built for publication: On a one-dimensional interval search problem

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