Geodesic
Complexity of self-correcting algorithms for two search problems
Diskretnaya Matematika, Tome 2 (1990) no. 3, pp. 50-55.

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

@article{DM_1990_2_3_a5,
     author = {V. V. Morozenko},
     title = {Complexity of self-correcting algorithms for two search problems},
     journal = {Diskretnaya Matematika},
     pages = {50--55},
     publisher = {mathdoc},
     volume = {2},
     number = {3},
     year = {1990},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1990_2_3_a5/}
}
TY  - JOUR
AU  - V. V. Morozenko
TI  - Complexity of self-correcting algorithms for two search problems
JO  - Diskretnaya Matematika
PY  - 1990
SP  - 50
EP  - 55
VL  - 2
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_1990_2_3_a5/
LA  - ru
ID  - DM_1990_2_3_a5
ER  - 
%0 Journal Article
%A V. V. Morozenko
%T Complexity of self-correcting algorithms for two search problems
%J Diskretnaya Matematika
%D 1990
%P 50-55
%V 2
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_1990_2_3_a5/
%G ru
%F DM_1990_2_3_a5
V. V. Morozenko. Complexity of self-correcting algorithms for two search problems. Diskretnaya Matematika, Tome 2 (1990) no. 3, pp. 50-55. http://geodesic.mathdoc.fr/item/DM_1990_2_3_a5/