1. Andersson, A., Lai, T.W.: Fast updating of well-balanced trees. In: Proc. of the Second Scandinavian Worshop on Algorithm Theory. LNCS, vol. 447, pp. 111–121 (1990)
2. Lecture Notes in Computer Science;P. Bose,2000
3. Bose, P., Krizanc, D., Langerman, S., Morin, P.: Asymmetric communication protocols via hotlink assignments. In: Proc. of the 9th Coll. on Structural Information and Communication Complexity (SIROCCO 2002), pp. 33–40 (2002)
4. Lecture Notes in Computer Science;H. Brönnimann,2003
5. Czyzowicz, J., Kranakis, E., Krizanc, D., Pelc, A., Martin, M.V.: Evaluation of hotlink assignment heuristics for improving web access. In: Proc. 2nd Int. Conf. on Internet Computing (IC 2001), pp. 793–799 (2001)