Geodesic
Asymptotics of the complexity of interval search on a Boolean cube in the class of balanced trees
Diskretnaya Matematika, Tome 16 (2004) no. 4, pp. 65-78

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

For a problem of interval search on the Boolean cube, we study the asymptotic behaviour of the average search time in the class of balanced tree circuits on sequences of positive integers $\{k_i\}$ under the assumption that $k_i$ are cardinalities of databases. We show that the asymptotic behaviour may differ on different sequences. We give a complete description of the class of possible behaviours. This research was supported by the Russian Foundation for Basic Research, grant 01–01–00748. 
@article{DM_2004_16_4_a6,
     author = {T. D. Blaivas},
     title = {Asymptotics of the complexity of interval search on a {Boolean} cube in the class of balanced trees},
     journal = {Diskretnaya Matematika},
     pages = {65--78},
     publisher = {mathdoc},
     volume = {16},
     number = {4},
     year = {2004},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2004_16_4_a6/}
}
TY  - JOUR
AU  - T. D. Blaivas
TI  - Asymptotics of the complexity of interval search on a Boolean cube in the class of balanced trees
JO  - Diskretnaya Matematika
PY  - 2004
SP  - 65
EP  - 78
VL  - 16
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2004_16_4_a6/
LA  - ru
ID  - DM_2004_16_4_a6
ER  - 
%0 Journal Article
%A T. D. Blaivas
%T Asymptotics of the complexity of interval search on a Boolean cube in the class of balanced trees
%J Diskretnaya Matematika
%D 2004
%P 65-78
%V 16
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2004_16_4_a6/
%G ru
%F DM_2004_16_4_a6
T. D. Blaivas. Asymptotics of the complexity of interval search on a Boolean cube in the class of balanced trees. Diskretnaya Matematika, Tome 16 (2004) no. 4, pp. 65-78. http://geodesic.mathdoc.fr/item/DM_2004_16_4_a6/