Geodesic
A constant, in the worst case, algorithm for the search for identical objects
Diskretnaya Matematika, Tome 11 (1999) no. 4, pp. 139-144

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

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. 
@article{DM_1999_11_4_a11,
     author = {\`E. \`E. Gasanov and Yu. P. Lugovskaya},
     title = {A constant, in the worst case, algorithm for the search for identical objects},
     journal = {Diskretnaya Matematika},
     pages = {139--144},
     publisher = {mathdoc},
     volume = {11},
     number = {4},
     year = {1999},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1999_11_4_a11/}
}
TY  - JOUR
AU  - È. È. Gasanov
AU  - Yu. P. Lugovskaya
TI  - A constant, in the worst case, algorithm for the search for identical objects
JO  - Diskretnaya Matematika
PY  - 1999
SP  - 139
EP  - 144
VL  - 11
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_1999_11_4_a11/
LA  - ru
ID  - DM_1999_11_4_a11
ER  - 
%0 Journal Article
%A È. È. Gasanov
%A Yu. P. Lugovskaya
%T A constant, in the worst case, algorithm for the search for identical objects
%J Diskretnaya Matematika
%D 1999
%P 139-144
%V 11
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_1999_11_4_a11/
%G ru
%F DM_1999_11_4_a11
È. È. Gasanov; Yu. P. Lugovskaya. A constant, in the worst case, algorithm for the search for identical objects. Diskretnaya Matematika, Tome 11 (1999) no. 4, pp. 139-144. http://geodesic.mathdoc.fr/item/DM_1999_11_4_a11/