1. Alon, N., Schieber, B.: Optimal preprocessing for answering on-line product queries. Technical report, Department of Computer Science, School of Mathematical Sciences, Tel Aviv University (1987)
2. Lecture Notes in Computer Science;S. Alstrup,2000
3. Alstrup, S., Husfeldt, T., Rauhe, T.: Marked ancestor problems. In: Proc. 39th Annual Symposium on Foundations of Computer Science, p. 534. IEEE Computer Society, Washington, DC, USA (1998)
4. Alstrup, S., Secher, J., Spork, M.: Optimal on-line decremental connectivity in trees. Information Processing Letters 64(4), 161–164 (1997)
5. Bose, P., Maheshwari, A., Narasimhan, G., Smid, M., Zeh, N.: Approximating geometric bottleneck shortest paths. Computational Geometry 29(3), 233–249 (2004)