Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnaya Matematika, 2004, Volume 16, Issue 4, Pages 49–64
DOI: https://doi.org/10.4213/dm175 (Mi dm175) 		 
This article is cited in 1 scientific paper (total in 1 paper)

A nonexhaustive algorithm, linear with respect to memory, for solving a two-dimensional interval search problem

È. È. Gasanov, A. N. Erokhin
Full-text PDF (1335 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm175
Abstract: We suggest an algorithm to solve a two-dimensional interval search problem which is characterised by the memory consumed of order $k$, the average search time (without the time needed to output the answer) of order $\sqrt k$, where $k$ is the database size.
This research was supported by the Russian Foundation for Basic Research, grant 01–01–00748.
Received: 31.10.2002
English version:
Discrete Mathematics and Applications, 2004, Volume 14, Issue 6, Pages 631–646
DOI: https://doi.org/10.1515/1569392043272449
Bibliographic databases:
UDC: 519.7
Language: Russian
Citation: È. È. Gasanov, A. N. Erokhin, “A nonexhaustive algorithm, linear with respect to memory, for solving a two-dimensional interval search problem”, Diskr. Mat., 16:4 (2004), 49–64; Discrete Math. Appl., 14:6 (2004), 631–646
Citation in format AMSBIB
\Bibitem{GasEro04}
\by \`E.~\`E.~Gasanov, A.~N.~Erokhin
\paper A nonexhaustive algorithm, linear with respect to memory, for solving a two-dimensional interval search problem
\jour Diskr. Mat.
\yr 2004
\vol 16
\issue 4
\pages 49--64
\mathnet{http://mi.mathnet.ru/dm175}
\crossref{https://doi.org/10.4213/dm175}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2141145}
\zmath{https://zbmath.org/?q=an:1106.90037}
\transl
\jour Discrete Math. Appl.
\yr 2004
\vol 14
\issue 6
\pages 631--646
\crossref{https://doi.org/10.1515/1569392043272449}
Linking options:
  • https://www.mathnet.ru/eng/dm175
  • https://doi.org/10.4213/dm175
  • https://www.mathnet.ru/eng/dm/v16/i4/p49
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:497
    Full-text PDF :211
    References:52
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024