Asymptotics of the complexity of interval search on a Boolean cube in the class of balanced trees
T. D. Blaivas

References
1.	Blaivas T. D., “Optimalnoe reshenie zadachi intervalnogo poiska na bulevom kube v klasse sbalansirovannykh drevovidnykh skhem”, Intellektualnye sistemy (to appear)
2.	Blaivas T. D., “Reshenie zadachi intervalnogo poiska na bulevom kube”, Tezisy dokladov XIII Mezhdunarodnoi konferentsii “Problemy teoreticheskoi kibernetiki”, Kazan, 2002, 22
3.	Gasanov E. E., Kudryavtsev V. B., Teoriya khraneniya i poiska informatsii, Fizmatlit, Moskva, 2002