Geodesic
The algorithm for identical object searching with bounded worst-case complexity and linear memory
Diskretnaya Matematika, Tome 28 (2016) no. 2, pp. 3-11

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{DM_2016_28_2_a0,
     author = {\`E. \`E. Gasanov and A. M. Zubkov and N. V. Klykova},
     title = {The algorithm for identical object searching with bounded worst-case complexity and linear memory},
     journal = {Diskretnaya Matematika},
     pages = {3--11},
     publisher = {mathdoc},
     volume = {28},
     number = {2},
     year = {2016},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2016_28_2_a0/}
}
TY  - JOUR
AU  - È. È. Gasanov
AU  - A. M. Zubkov
AU  - N. V. Klykova
TI  - The algorithm for identical object searching with bounded worst-case complexity and linear memory
JO  - Diskretnaya Matematika
PY  - 2016
SP  - 3
EP  - 11
VL  - 28
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2016_28_2_a0/
LA  - ru
ID  - DM_2016_28_2_a0
ER  - 
%0 Journal Article
%A È. È. Gasanov
%A A. M. Zubkov
%A N. V. Klykova
%T The algorithm for identical object searching with bounded worst-case complexity and linear memory
%J Diskretnaya Matematika
%D 2016
%P 3-11
%V 28
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2016_28_2_a0/
%G ru
%F DM_2016_28_2_a0
È. È. Gasanov; A. M. Zubkov; N. V. Klykova. The algorithm for identical object searching with bounded worst-case complexity and linear memory. Diskretnaya Matematika, Tome 28 (2016) no. 2, pp. 3-11. http://geodesic.mathdoc.fr/item/DM_2016_28_2_a0/