I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992
iR trees are parameterized binary search trees which rebalance themselves locally. In our previous work the cases for i=1, 2 were studied. This note extends the result to arbitrary i. In particular, we derive a formula for the average number of rotations/reorganizations involved in an insertion and consequently a formula for the average number of comparisons for a successful search in iR trees. © 1984 BIT Foundations.
I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992
Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control
Timothy J. Wiltshire, Joseph P. Kirk, et al.
SPIE Advanced Lithography 1998
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989