RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
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., 2016, Volume 28, Issue 2, Pages 3–11 (Mi dm1364)  

The algorithm for identical object searching with bounded worst-case complexity and linear memory

È. È. Gasanova, A. M. Zubkovb, N. V. Klykovac

a Lomonosov Moscow State University
b Steklov Mathematical Institute of Russian Academy of Sciences, Moscow
c PSC Lukoil

Abstract: We propose and investigate new algorithms permitting to find an identical object in the database using the number of operations not depending on the volume of the database. One algorithm requires memory size that depends linearly on the database volume in the average.

Keywords: key search, time complexity of algorithms, memory size

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

Full text: PDF file (425 kB)
First page: PDF file
References: PDF file   HTML file

English version:
Discrete Mathematics and Applications, 2016, 26:5, 273–278

Bibliographic databases:

Document Type: Article
UDC: 519.712.43
Received: 06.12.2015

Citation: È. È. Gasanov, A. M. Zubkov, N. V. Klykova, “The algorithm for identical object searching with bounded worst-case complexity and linear memory”, Diskr. Mat., 28:2 (2016), 3–11; Discrete Math. Appl., 26:5 (2016), 273–278

Citation in format AMSBIB
\Bibitem{GasZubKly16}
\by \`E.~\`E.~Gasanov, A.~M.~Zubkov, N.~V.~Klykova
\paper The algorithm for identical object searching with bounded worst-case complexity and linear memory
\jour Diskr. Mat.
\yr 2016
\vol 28
\issue 2
\pages 3--11
\mathnet{http://mi.mathnet.ru/dm1364}
\crossref{https://doi.org/10.4213/dm1364}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3559787}
\zmath{https://zbmath.org/?q=an:06653792}
\elib{http://elibrary.ru/item.asp?id=26414198}
\transl
\jour Discrete Math. Appl.
\yr 2016
\vol 26
\issue 5
\pages 273--278
\crossref{https://doi.org/10.1515/dma-2016-0024}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000390939400003}
\elib{http://elibrary.ru/item.asp?id=27578914}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84996962825}


Linking options:
  • http://mi.mathnet.ru/eng/dm1364
  • https://doi.org/10.4213/dm1364
  • http://mi.mathnet.ru/eng/dm/v28/i2/p3

    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
  • Дискретная математика
    Number of views:
    This page:244
    References:22
    First page:44

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