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

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


Diskr. Mat., 1999, Volume 11, Issue 4, Pages 139–144 (Mi dm396)  

This article is cited in 2 scientific papers (total in 2 papers)

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

È. È. Gasanov, Yu. P. Lugovskaya


Abstract: We suggest an algorithm to search for identical objects, which, using a memory of volume of order $k^2$, almost always performs searching over a set of cardinality $k$ in six elementary operations in the worst case.
The research was supported by the Russian Foundation for Basic Research, grant 98–01–00130.

DOI: https://doi.org/10.4213/dm396

Full text: PDF file (551 kB)

English version:
Discrete Mathematics and Applications, 1999, 9:6, 679–684

Bibliographic databases:

UDC: 519.7
Received: 16.10.1998
Revised: 22.07.1999

Citation: È. È. Gasanov, Yu. P. Lugovskaya, “A constant, in the worst case, algorithm for the search for identical objects”, Diskr. Mat., 11:4 (1999), 139–144; Discrete Math. Appl., 9:6 (1999), 679–684

Citation in format AMSBIB
\Bibitem{GasLug99}
\by \`E.~\`E.~Gasanov, Yu.~P.~Lugovskaya
\paper A constant, in the worst case, algorithm for the search for identical objects
\jour Diskr. Mat.
\yr 1999
\vol 11
\issue 4
\pages 139--144
\mathnet{http://mi.mathnet.ru/dm396}
\crossref{https://doi.org/10.4213/dm396}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1761019}
\zmath{https://zbmath.org/?q=an:0968.68039}
\transl
\jour Discrete Math. Appl.
\yr 1999
\vol 9
\issue 6
\pages 679--684


Linking options:
  • http://mi.mathnet.ru/eng/dm396
  • https://doi.org/10.4213/dm396
  • http://mi.mathnet.ru/eng/dm/v11/i4/p139

    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
    2. È. È. Gasanov, A. M. Zubkov, N. V. Klykova, “The algorithm for identical object searching with bounded worst-case complexity and linear memory”, Discrete Math. Appl., 26:5 (2016), 273–278  mathnet  crossref  crossref  mathscinet  zmath  isi  elib  elib
  • Дискретная математика
    Number of views:
    This page:242
    Full text:111
    First page:1

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