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

This publication is cited in the following articles:

1. E. E. Gasanov, “Information storage and search complexity theory”, J. Math. Sci., 168:1 (2010), 32–48      
2. T. D. Blaivas, “The Shannon function of the complexity of interval search on a Boolean cube in the class of trees”, Discrete Math. Appl., 16:3 (2006), 259–270