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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Fundam. Prikl. Mat.:
Year:
Volume:
Issue:
Page:
Find






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


Fundam. Prikl. Mat., 1997, Volume 3, Issue 3, Pages 759–773 (Mi fpm242)  

This article is cited in 1 scientific paper (total in 1 paper)

On one mathematical model of the background search algorithms and the quick algorithm for the two-dimensional domination problem

È. È. Gasanov, T. V. Mkhitarova

M. V. Lomonosov Moscow State University

Abstract: Background search algorithms are investigated and a mathematical model of these algorithms is suggested in this paper. This model is based on the concept of the informational network with switches (INS), but INS complexity measure takes into account the user processing times of answer elements. The quick background algorithm solving the two-dimensional domination problem is suggested. This algorithm requires linear memory. We note that nonbackground algorithm with constant average search time requires quadratic memory.

Full text: PDF file (594 kB)

Bibliographic databases:
UDC: 519.1
Received: 01.11.1995

Citation: È. È. Gasanov, T. V. Mkhitarova, “On one mathematical model of the background search algorithms and the quick algorithm for the two-dimensional domination problem”, Fundam. Prikl. Mat., 3:3 (1997), 759–773

Citation in format AMSBIB
\Bibitem{GasMkh97}
\by \`E.~\`E.~Gasanov, T.~V.~Mkhitarova
\paper On one mathematical model of the background search algorithms and the quick algorithm for the two-dimensional domination problem
\jour Fundam. Prikl. Mat.
\yr 1997
\vol 3
\issue 3
\pages 759--773
\mathnet{http://mi.mathnet.ru/fpm242}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1794140}
\zmath{https://zbmath.org/?q=an:0932.68033}


Linking options:
  • http://mi.mathnet.ru/eng/fpm242
  • http://mi.mathnet.ru/eng/fpm/v3/i3/p759

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. E. E. Gasanov, “Information storage and search complexity theory”, J. Math. Sci., 168:1 (2010), 32–48  mathnet  crossref  mathscinet
  • Фундаментальная и прикладная математика
    Number of views:
    This page:208
    Full text:86
    First page:2

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020