Conference paper
Characterization of line width variation
Alfred K. Wong, Antoinette F. Molless, et al.
SPIE Advanced Lithography 2000
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.
Alfred K. Wong, Antoinette F. Molless, et al.
SPIE Advanced Lithography 2000
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
Jonathan Ashley, Brian Marcus, et al.
Ergodic Theory and Dynamical Systems
Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences