Fetching the paper…
Reading the bibliography…
Similarity search is a fundamental algorithmic primitive, widely used in many computer science disciplines.
Probabilistic Counting Algorithms for Data Base Applications
Philippe Flajolet and G. Nigel Martin. 1985 · 1985
Earlier work this paper cites.
Random sampling from databases: a survey
Frank Olken and Doron Rotem. 1995a · 1995
Earlier work this paper cites.
Sampling from spatial databases
Frank Olken and Doron Rotem. 1995b · 1995
Earlier work this paper cites.
On the resemblance and containment of documents. In Proc. Compression and Complexity of Sequences . 21–29
Andrei Z. Broder. 1997 · 1997
Earlier work this paper cites.
The Art of Computer Programming, Volume 2: Seminumerical Algorithms
Donald E. Knuth. 1997 · 1997
Earlier work this paper cites.
Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. In Proc. 30th ACM Symposium on the Theory of Computing (STOC) . 604–613
Piotr Indyk and Rajeev Motwani. 1998 · 1998
Earlier work this paper cites.
A Nonsymmetric Correlation Inequality for Gaussian Measure
Stanislaw J. Szarek and Elisabeth Werner. 1999 · 1999
Earlier work this paper cites.
Counting Distinct Elements in a Data Stream. In Proc. 6th International Workshop Randomization and Approximation Techniques (RANDOM) . 1–10
Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, and Luca Trevisan. 2002 · 2002
Earlier work this paper cites.
Similarity estimation techniques from rounding algorithms. In Proc. 34th ACM Symposium on Theory of Computing (STOC) . 380–388
Moses Charikar. 2002 · 2002
Earlier work this paper cites.
Order statistics
Herbert Aron David and Haikady Navada Nagaraja. 2004 · 2004
Earlier work this paper cites.
A New Algorithm for Optimal 2-constraint Satisfaction and Its Implications
Ryan Williams. 2005 · 2005
Earlier work this paper cites.
Locality sensitive hash functions based on concomitant rank order statistics. In Proc. 14th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD) . ACM, 221–229
Kave Eshghi and Shyamsundar Rajaram. 2008 · 2008
Earlier work this paper cites.
Matrix Factorization Techniques for Recommender Systems
Yehuda Koren, Robert M. Bell, and Chris Volinsky. 2009 · 2009
Cited alongside, same era.
b-Bit minwise hashing. In Proc. of International Conference on World Wide Web (WWW) . 671–680
Ping Li and Arnd Christian König. 2010 · 2010
Cited alongside, same era.
k-NN As an Implementation of Situation Testing for Discrimination Discovery and Prevention. In Proc. 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) . 502–510
Binh Thanh Luong, Salvatore Ruggieri, and Franco Turini. 2011 · 2011
Cited alongside, same era.
Fairness through awareness. In Proc. Innovations in Theoretical Computer Science (ITCS) . 214–226
Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, and Richard S. Zemel. 2012 · 2012
Cited alongside, same era.
Optimization-based approaches for maximizing aggregate recommendation diversity
Gediminas Adomavicius and YoungOk Kwon. 2014 · 2014
Cited alongside, same era.
Independent Range Sampling, Revisited. In Proc. 25th Annual European Symposium on Algorithms (ESA) . 3:1–3:14
Peyman Afshani and Zhewei Wei. 2017 · 2017
Later among the works it cites.
Parameter-free Locality Sensitive Hashing for Spherical Range Reporting. In Proc. 28th Symposium on Discrete Algorithms (SODA) . 239–256
Thomas D. Ahle, Martin Aumüller, and Rasmus Pagh. 2017 · 2017
Later among the works it cites.
Hashing-Based-Estimators for Kernel Density in High Dimensions. In Proc. 58th IEEE Annual Symposium on Foundations of Computer Science (FOCS) . 1032–1043
Moses Charikar and Paris Siminelakis. 2017 · 2017
Later among the works it cites.
A Framework for Similarity Search with Space-Time Tradeoffs using Locality-Sensitive Filtering. In Proc. 28th Symposium on Discrete Algorithms (SODA) . 31–46
Tobias Christiani. 2017 · 2017
Later among the works it cites.
Approximate Nearest Neighbor Search in High Dimensions. In Proc. International Congress of Mathematicians (ICM) . 3271–3302
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Independent range sampling. In Proc. 33rd ACM Symposium on Principles of Database Systems (PODS) . 246–255
Xiaocheng Hu, Miao Qiao, and Yufei Tao. 2014 · 2014
Cited alongside, same era.
Probabilistic Polynomials and Hamming Nearest Neighbors. In Proc. 56th IEEE Annual Symposium on Foundations of Computer Science (FOCS) . 136–150
Josh Alman and Ryan Williams. 2015 · 2015
Cited alongside, same era.
On the (im)possibility of fairness
Sorelle A. Friedler, Carlos Scheidegger, and Suresh Venkatasubramanian. 2016 · 2016
Cited alongside, same era.
Equality of Opportunity in Supervised Learning. In Proc. Annual Conference on Neural Information Processing Systems (NIPS) . 3315–3323
Moritz Hardt, Eric Price, and Nati Srebro. 2016 · 2016
Cited alongside, same era.
Big data: A report on algorithmic systems, opportunity, and civil rights
Executive Office of the President. 2016 · 2016
Cited alongside, same era.
M. Sadegh Riazi, Beidi Chen, Anshumali Shrivastava, Dan S. Wallach, and Farinaz Koushanfar. 2016 · 2016
Cited alongside, same era.
Research Directions for Principles of Data Management (Abridged)
Serge Abiteboul, Marcelo Arenas, Pablo Barceló, Meghyn Bienvenu, Diego Calvanese, Claire David, Richard Hull, Eyke Hüllermeier, Benny Kimelfeld, Leonid Libkin, Wim Martens, Tova Milo, Filip Murlak, Frank Neven, Magdalena Ortiz, Thomas Schwentick, Julia Stoyanovich, Jianwen Su, Dan Suciu, Victor Vianu, and Ke Yi. 2017 · 2017
Cited alongside, same era.
Ilya P. Razenshteyn Alexandr Andoni, Piotr Indyk. 2018 · 2018
Later among the works it cites.
Distance-Sensitive Hashing. In Proc. 37th ACM Symposium on Principles of Database Systems (PODS) . 89–104
Martin Aumüller, Tobias Christiani, Rasmus Pagh, and Francesco Silvestri. 2018 · 2018
Later among the works it cites.
User Fairness in Recommender Systems. In Companion Proceedings of the The Web Conference (WWW) . 101–102
Jurek Leonhardt, Avishek Anand, and Megha Khosla. 2018 · 2018
Later among the works it cites.
Independent Range Sampling, Revisited Again. In Proc. 35th International Symposium on Computational Geometry (SoCG) . 4:1–4:13
Peyman Afshani and Jeff M. Phillips. 2019 · 2019
Closest in time.
Near Neighbor: Who is the Fairest of Them All?
Sariel Har-Peled and Sepideh Mahabadi. 2019 · 2019
Closest in time.
Downstream Effects of Affirmative Action. In Proc. Conference on Fairness, Accountability, and Transparency (FAT*)
Sampath Kannan, Aaron Roth, and Juba Ziani. 2019 · 2019
Closest in time.
Fairness and Abstraction in Sociotechnical Systems. In Proc. ACM Conference on Fairness, Accountability, and Transparency (FAT*)
Andrew D. Selbst, danah boyd, Sorelle Friedler, Suresh Venkatasubramanian, and Janet Vertesi. 2019 · 2019
Closest in time.
Algorithmic Fairness: Measures, Methods and Representations. In Proc. 38th ACM Symposium on Principles of Database Systems (PODS) . 481
Suresh Venkatasubramanian. 2019 · 2019
Closest in time.