1. Lecture Notes in Computer Science;D Belazzougui,2010
2. Belazzougui, D., Boldi, P., Vigna, S.: Predecessor search with distance-sensitive query time (2012). arXiv:1209.5441
3. Bose, P., Douïeb, K., Dujmovic, V., Howat, J., Morin, P.: Fast local searches and updates in bounded universes. Comput. Geom. Theory Appl. 46(2), 181–189 (2013)
4. Chan, T.M.: Closest-point problems simplified on the RAM. In: Proc. 13th Annu. ACM-SIAM Sympos. Discrete Algorithms (SODA), pp. 472–473 (2002)
5. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms, 3rd edn. MIT Press (2009)