E. Achtert, C. Böhm, P. Kröger, P. Kunath, A. Pryakhin et al., Efficient reverse k-nearest neighbor search in arbitrary metric spaces, Proceedings of the 2006 ACM SIGMOD international conference on Management of data , SIGMOD '06, pp.515-526, 2006.
DOI : 10.1145/1142473.1142531

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.5280

A. Andoni and P. Indyk, Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions, Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp.459-468, 2006.

S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu, An optimal algorithm for approximate nearest neighbor searching fixed dimensions, Journal of the ACM, vol.45, issue.6, pp.891-923, 1998.
DOI : 10.1145/293347.293348

R. Benetis and C. Jensen, Gytis Kar?ciauskasKar?ciauskas, and Simonas?SaltenisSimonas? Simonas?Saltenis. Nearest and Reverse Nearest Neighbor Queries for Moving Objects. The International Journal on Very Large Data Bases, pp.229-249, 2006.

S. Cabello, J. Miguel-díaz-báñez, S. Langerman, C. Seara, and I. Ventura, Facility location problems in the plane based on reverse nearest neighbor queries, European Journal of Operational Research, vol.202, issue.1, 2009.
DOI : 10.1016/j.ejor.2009.04.021

O. Cheong, A. Vigneron, and J. Yon, REVERSE NEAREST NEIGHBOR QUERIES IN FIXED DIMENSION, International Journal of Computational Geometry & Applications, vol.21, issue.02
DOI : 10.1142/S0218195911003603

L. Kenneth and . Clarkson, An Algorithm for Approximate Closest-point Queries, Proceedings of the Tenth Annual Symposium on Computational Geometry, pp.160-164, 1994.

L. Kenneth and . Clarkson, Nearest neighbor queries in metric spaces. Discrete and Computational Geometry, pp.63-93, 1999.

L. Kenneth and . Clarkson, Nearest neighbor searching in metric spaces: Experimental results for sb(s) Preliminary version presented at ALENEX99, 2003.

L. Kenneth and . Clarkson, Nearest-neighbor searching and metric space dimensions, Nearest-Neighbor Methods for Learning and Vision: Theory and Practice, pp.15-59, 2006.

M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni, Locality-sensitive hashing scheme based on p-stable distributions, Proceedings of the twentieth annual symposium on Computational geometry , SCG '04, pp.253-262, 2004.
DOI : 10.1145/997817.997857

K. Figueroa and R. Paredes, Approximate Direct and Reverse Nearest Neighbor Queries, and the k-nearest Neighbor Graph, 2009 Second International Workshop on Similarity Search and Applications, 2009.
DOI : 10.1109/SISAP.2009.33

A. Gionis, P. Indyk, and R. Motwani, Similarity Search in High Dimensions via Hashing, Proceedings of the 25th International Conference on Very Large Data Bases, pp.518-529, 1999.

S. Har-peled, A replacement for Voronoi diagrams of near linear size, Proceedings 2001 IEEE International Conference on Cluster Computing, pp.94-105, 2001.
DOI : 10.1109/SFCS.2001.959884

S. Har-peled, P. Indyk, and R. Motwani, Approximate nearest neighbor: Towards removing the curse of dimensionality, p.26, 2010.

K. Hildrum, J. Kubiatowicz, S. Ma, and S. Rao, A note on the nearest neighbor in growth-restricted metrics, Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, SODA '04, pp.560-561, 2004.

P. Indyk, Nearest Neighbors in High-Dimensional Spaces, Handbook of Discrete and Computational Geometry, pp.877-892, 2004.
DOI : 10.1201/9781420035315.ch39

P. Indyk and R. Motwani, Approximate nearest neighbors, Proceedings of the thirtieth annual ACM symposium on Theory of computing , STOC '98, pp.604-613, 1998.
DOI : 10.1145/276698.276876

W. B. Johnson and G. Schechtman, Embedding l ${}_{p}^{m}$ into l ${}_{1}^{n}$, Acta Mathematica, vol.149, issue.0, pp.71-85, 1982.
DOI : 10.1007/BF02392350

J. M. Kang, M. F. Mokbel, S. Shekhar, T. Xia, and D. Zhang, Continuous Evaluation of Monochromatic and Bichromatic Reverse Nearest Neighbors, 2007 IEEE 23rd International Conference on Data Engineering, 2007.
DOI : 10.1109/ICDE.2007.367926

R. David, M. Karger, and . Ruhl, Finding nearest neighbors in growth-restricted metrics, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, STOC '02, pp.741-750, 2002.

J. M. Kleinberg, Two algorithms for nearest-neighbor search in high dimensions, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , STOC '97, pp.599-608, 1997.
DOI : 10.1145/258533.258653

F. Korn and S. Muthukrishnan, Influence sets based on reverse nearest neighbor queries, ACM SIGMOD Record, vol.29, issue.2, pp.201-212, 1920.
DOI : 10.1145/335191.335415

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.7865

R. Krauthgamer and J. R. Lee, Navigating nets: simple algorithms for proximity search, Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, SODA '04, pp.798-807, 2004.

Y. Kumar, R. Janardan, and P. Gupta, Efficient algorithms for reverse proximity query problems, Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems, GIS '08, 2008.
DOI : 10.1145/1463434.1463483

E. Kushilevitz, R. Ostrovsky, and Y. Rabani, Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces, SIAM Journal on Computing, vol.30, issue.2, pp.457-474, 2000.
DOI : 10.1137/S0097539798347177

A. Maheshwari, J. Vahrenhold, and N. Zeh, On Reverse Nearest Neighbor Queries, Proceedings of Canadian Conference on Computational Geometry, pp.128-132, 2002.

F. Pfender and G. M. Ziegler, Kissing Numbers, Sphere Packings, and Some Unexpected Proofs, pp.873-883, 2004.

G. Shakhnarovich, T. Darrell, and P. Indyk, Nearest-neighbor Methods in Learning and Vision: Theory and Practice, 2005.

A. Singh, H. Ferhatosmanoglu, and A. S. ¸aman-tosun, High dimensional reverse nearest neighbor queries, Proceedings of the twelfth international conference on Information and knowledge management , CIKM '03, pp.91-98, 2003.
DOI : 10.1145/956863.956882

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.1869

I. Stanoi, D. Agrawal, and . Abbadi, Reverse Nearest Neighbor Queries for Dynamic Databases, ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, issue.3, pp.44-53, 2000.

Y. Tao, D. Papadias, and X. Lian, Reverse k-NN Search in Arbitrary Dimensionality, Proceedings of the Thirtieth international Conference on Very Large Databases, pp.744-755, 2004.

Y. Tao, M. L. Yiu, and N. Mamoulis, Reverse Nearest Neighbor Search in Metric Spaces, IEEE Transactions on Knowledge and Data Engineering, issue.3, pp.1239-1252, 2006.

R. Weber, H. Schek, and S. Blott, A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces, VLDB '98: Proceedings of the 24rd International Conference on Very Large Data Bases, pp.194-205, 1998.