Y. Bachrach and E. Porat, Sketching for big data recommender systems using fast pseudo-random fingerprints, ICALP, 2013.

X. Bai, M. Bertier, R. Guerraoui, A. Kermarrec, and V. Leroy, Gossiping personalized queries, EDBT, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00455643

M. Bertier, D. Frey, R. Guerraoui, A. Kermarrec, and V. Leroy, The gossple anonymous social network, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00515693

A. Beygelzimer, S. Kakade, and J. Langford, Cover trees for nearest neighbor, ICML, 2006.

A. Boutet, D. Frey, R. Guerraoui, A. Kermarrec, and R. Patra, Hyrec: leveraging browsers for scalable recommenders, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01080016

A. Boutet, A. Kermarrec, N. Mittal, and F. Taïani, Being prepared in a sparse world: the case of knn graph construction, ICDE, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01251010

A. Z. Broder, On the resemblance and containment of documents, Compression and Complexity of Sequences, 1997.

J. Chen, H. Fang, and Y. Saad, Fast approximate knn graph construction for high dimensional data via recursive lanczos bisection, J. of ML Research, 2009.

B. Cui, H. T. Shen, J. Shen, and K. Tan, Exploring bit-difference for approximate knn search in high-dimensional databases, AusDM, 2005.

W. Dong, C. Moses, and K. Li, Efficient k-nearest neighbor graph construction for generic similarity measures, 2011.

M. Gorai, K. Sridharan, T. Aditya, R. Mukkamala, and S. Nukavarapu, Employing bloom filters for privacy preserving distributed collaborative knn classification, WICT, 2011.

F. M. Harper and J. A. Konstan, The movielens datasets: History and context, ACM Trans. Interact. Intell. Syst, 2015.

P. Indyk and R. Motwani, Approximate nearest neighbors: towards removing the curse of dimensionality, STOC, 1998.

B. Jenkins, Hash functions, Dr Dobbs Journal, 1997.

K. Keeton, C. B. Morrey, I. , C. A. Soules, and A. Veitch, Lazybase: freshness vs. performance in information management, SIGOPS Op. Sys. Review, 2010.

A. Kermarrec, O. Ruas, and F. Taïani, Nobody cares if you liked star wars: KNN graph construction on the cheap, Euro-Par, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01867230

A. Labrinidis and N. Roussopoulos, Exploring the tradeoff between performance and data freshness in database-driven web servers, The VLDB Journal, 2004.

X. N. Lam, T. Vu, T. D. Le, and A. D. Duong, Addressing cold-start problem in recommendation systems, IMCOM, 2008.

J. J. Levandoski, M. Sarwat, A. Eldawy, and M. F. Mokbel, Lars: A location-aware recommender system, ICDE, 2012.

P. Li and A. C. König, Theory and applications of b-bit minwise hashing, 2011.

G. Linden, B. Smith, and J. York, Amazon. com recommendations: Item-to-item collaborative filtering, 2003.

T. Liu, A. W. Moore, K. Yang, and A. G. Gray, An investigation of practical approximate nearest neighbor algorithms, Advances in neural information processing systems, 2004.

J. J. Mcauley and J. Leskovec, From amateurs to connoisseurs: modeling the evolution of user expertise through online reviews, 2013.

A. W. Moore, The anchors hierarchy: Using the triangle inequality to survive high dimensional data, UAI, 2000.

N. Nodarakis, S. Sioutas, D. Tsoumakos, G. Tzimas, and E. Pitoura, Rapid aknn query processing for fast classification of multidimensional data in the cloud, CoRR, 2014.

P. Resnick, N. Iacovou, M. Suchak, P. Bergstrom, and J. Riedl, Grouplens: an open architecture for collaborative filtering of netnews, 1994.

C. J. Van-rijsbergen, Information retrieval, 1979.