1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
2. M. Ben-Or, Lower Bounds for Algebraic Computation Trees, Proc. 15th ACM STOC (1983), pp. 80–86.
3. A. Björner, L. Lov’asz and A. Yao, Linear Decision Trees: Volume Estimates and Topological Bounds, Proc. 24th ACM STOC (1992), pp. 170–177.
4. Lect Notes Comput Sci;A. Borodin,1993
5. A. Borodin, R. Ostrovsky and Y. Rabani, Lower Bounds for High Dimensional Nearest Neighbour Search and Related Problems, Proc. 31st ACM STOC (1999), pp. 312–321.