1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Reading, MA, Addison-Wesley 1974
2. Bentley, J.L., Shamos, M.I.: Divide-and-conquer in multidimensional space. Proc. 8th Ann. ACM Symp. Theory Comput. (1976), pp. 220–230
3. Blum, M., Floyd, R.W., Pratt, V.R., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Syst. Sci. 7, 448–161 (1972)
4. Chazelle, B.: Filtering search: A new approach to query-answering. SIAM J. Comput. 15, 703–724 (1986)
5. Chazelle, B.: Fast searching in a real algebraic manifold with applications to geometric complexity. Proc. CAAP'85, Berlin, LNCS, pp 145–156. Berlin, Heidelberg, New York: Springer Verlag 1985