A linear in memory non-exhaustive algorithm to solve a two-dimensional interval search problem

DOI10.1163/1569392043272449MaRDI QIDQ3409863zbMATH OpenOpenAlexFDO

Authors El'yar E. Gasanov, A. N. Erokhin

Publication date 20 November 2006

Full work available at URL https://doi.org/10.1163/1569392043272449

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Search theory (90B40)

Recommendations

• On the functional complexity of a two-dimensional interval search problem
• On a one-dimensional interval search problem
• scientific article; zbMATH DE number 1320677
• scientific article; zbMATH DE number 3907783
• Features of solving the range searching problems for d-dimensional case

Cited in

(5)

• Information storage and search complexity theory
• The algorithm for identical object searching with bounded worst-case complexity and linear memory
• On the functional complexity of a two-dimensional interval search problem
• On a one-dimensional interval search problem
• Partial memoization for obtaining linear time behavior of a 2DPDA

This page was built for publication: A linear in memory non-exhaustive algorithm to solve a two-dimensional interval search problem

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