{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T14:24:16Z","timestamp":1785594256604,"version":"3.56.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,14]],"date-time":"2020-06-14T00:00:00Z","timestamp":1592092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Ministero dell\u00f0Istruzione, dell\u00f0Universit\u00e0 e della Ricerca","award":["20174LF3T8"],"award-info":[{"award-number":["20174LF3T8"]}]},{"name":"Universit\u00e0 degli Studi di Padova","award":["SID 2018"],"award-info":[{"award-number":["SID 2018"]}]},{"DOI":"10.13039\/100008398","name":"Villum Fonden","doi-asserted-by":"publisher","award":["16582"],"award-info":[{"award-number":["16582"]}],"id":[{"id":"10.13039\/100008398","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,14]]},"DOI":"10.1145\/3375395.3387648","type":"proceedings-article","created":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T15:10:29Z","timestamp":1590765029000},"page":"191-204","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Fair Near Neighbor Search: Independent Range Sampling in High Dimensions"],"prefix":"10.1145","author":[{"given":"Martin","family":"Aum\u00fcller","sequence":"first","affiliation":[{"name":"IT University of Copenhagen, Copenhagen, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rasmus","family":"Pagh","sequence":"additional","affiliation":[{"name":"BARC and IT University of Copenhagen, Copenhagen, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francesco","family":"Silvestri","sequence":"additional","affiliation":[{"name":"University of Padova, Padova, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3092931.3092933"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2013.0570"},{"key":"e_1_3_2_1_3_1","volume-title":"Revisited Again. In Proc. 35th International Symposium on Computational Geometry (SoCG). 4:1--4:13","author":"Afshani Peyman","unstructured":"Peyman Afshani and Jeff M. Phillips . 2019. 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. Independent Range Sampling, Revisited Again. In Proc. 35th International Symposium on Computational Geometry (SoCG). 4:1--4:13."},{"key":"e_1_3_2_1_4_1","volume-title":"Revisited. In Proc. 25th Annual European Symposium on Algorithms (ESA). 3:1--3:14","author":"Afshani Peyman","year":"2017","unstructured":"Peyman Afshani and Zhewei Wei . 2017 . Independent Range Sampling , Revisited. In Proc. 25th Annual European Symposium on Algorithms (ESA). 3:1--3:14 . Peyman Afshani and Zhewei Wei. 2017. Independent Range Sampling, Revisited. In Proc. 25th Annual European Symposium on Algorithms (ESA). 3:1--3:14."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/3039686.3039702"},{"key":"e_1_3_2_1_6_1","volume-title":"Proc. International Congress of Mathematicians (ICM). 3271--3302","author":"Ilya","unstructured":"Ilya P. Razenshteyn Alexandr Andoni, Piotr Indyk. 2018. Approximate Nearest Neighbor Search in High Dimensions . In Proc. International Congress of Mathematicians (ICM). 3271--3302 . Ilya P. Razenshteyn Alexandr Andoni, Piotr Indyk. 2018. Approximate Nearest Neighbor Search in High Dimensions. In Proc. International Congress of Mathematicians (ICM). 3271--3302."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.18"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/3039686.3039690"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.4"},{"key":"e_1_3_2_1_10_1","volume-title":"Distance-Sensitive Hashing. In Proc. 37th ACM Symposium on Principles of Database Systems (PODS). 89--104","author":"Aum\u00fcller Martin","year":"2018","unstructured":"Martin Aum\u00fcller , Tobias Christiani , Rasmus Pagh , and Francesco Silvestri . 2018 . Distance-Sensitive Hashing. In Proc. 37th ACM Symposium on Principles of Database Systems (PODS). 89--104 . Martin Aum\u00fcller, Tobias Christiani, Rasmus Pagh, and Francesco Silvestri. 2018. Distance-Sensitive Hashing. In Proc. 37th ACM Symposium on Principles of Database Systems (PODS). 89--104."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/646978.711822"},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. Compression and Complexity of Sequences. 21--29","author":"Broder Andrei Z.","year":"1997","unstructured":"Andrei Z. Broder . 1997 . On the resemblance and containment of documents . In Proc. Compression and Complexity of Sequences. 21--29 . Andrei Z. Broder. 1997. On the resemblance and containment of documents. In Proc. Compression and Complexity of Sequences. 21--29."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.99"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/3039686.3039689"},{"key":"e_1_3_2_1_16_1","volume-title":"Order statistics. Encyclopedia of Statistical Sciences","author":"David Herbert Aron","year":"2004","unstructured":"Herbert Aron David and Haikady Navada Nagaraja . 2004. Order statistics. Encyclopedia of Statistical Sciences ( 2004 ). Herbert Aron David and Haikady Navada Nagaraja. 2004. Order statistics. Encyclopedia of Statistical Sciences (2004)."},{"key":"e_1_3_2_1_17_1","volume-title":"Zemel","author":"Dwork Cynthia","year":"2012","unstructured":"Cynthia Dwork , Moritz Hardt , Toniann Pitassi , Omer Reingold , and Richard S . Zemel . 2012 . 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. Fairness through awareness. In Proc. Innovations in Theoretical Computer Science (ITCS). 214--226."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401921"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90041-8"},{"key":"e_1_3_2_1_20_1","volume-title":"On the (im)possibility of fairness. CoRR","author":"Friedler Sorelle A.","year":"2016","unstructured":"Sorelle A. Friedler , Carlos Scheidegger , and Suresh Venkatasubramanian . 2016. On the (im)possibility of fairness. CoRR , Vol. abs\/ 1609 .07236 ( 2016 ). Sorelle A. Friedler, Carlos Scheidegger, and Suresh Venkatasubramanian. 2016. On the (im)possibility of fairness. CoRR, Vol. abs\/1609.07236 (2016)."},{"key":"e_1_3_2_1_21_1","volume-title":"Proc. Advances in Neural Information Processing Systems (NeurIPS). 13176--13187","author":"Har-Peled Sariel","year":"2019","unstructured":"Sariel Har-Peled and Sepideh Mahabadi . 2019 . Near Neighbor: Who is the Fairest of Them All? In Proc. Advances in Neural Information Processing Systems (NeurIPS). 13176--13187 . Sariel Har-Peled and Sepideh Mahabadi. 2019. Near Neighbor: Who is the Fairest of Them All? In Proc. Advances in Neural Information Processing Systems (NeurIPS). 13176--13187."},{"key":"e_1_3_2_1_22_1","volume-title":"Proc. Annual Conference on Neural Information Processing Systems (NIPS). 3315--3323","author":"Hardt Moritz","year":"2016","unstructured":"Moritz Hardt , Eric Price , and Nati Srebro . 2016 . 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. Equality of Opportunity in Supervised Learning. In Proc. Annual Conference on Neural Information Processing Systems (NIPS). 3315--3323."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594538.2594545"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3287560.3287578"},{"key":"e_1_3_2_1_26_1","volume-title":"The Art of Computer Programming, Volume 2: Seminumerical Algorithms","author":"Knuth Donald E.","unstructured":"Donald E. Knuth . 1997. The Art of Computer Programming, Volume 2: Seminumerical Algorithms . Addison-Wesley . Donald E. Knuth. 1997. The Art of Computer Programming, Volume 2: Seminumerical Algorithms .Addison-Wesley."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_2_1_28_1","volume-title":"User Fairness in Recommender Systems. In Companion Proceedings of the The Web Conference (WWW). 101--102","author":"Leonhardt Jurek","year":"2018","unstructured":"Jurek Leonhardt , Avishek Anand , and Megha Khosla . 2018 . User Fairness in Recommender Systems. In Companion Proceedings of the The Web Conference (WWW). 101--102 . Jurek Leonhardt, Avishek Anand, and Megha Khosla. 2018. User Fairness in Recommender Systems. In Companion Proceedings of the The Web Conference (WWW). 101--102."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772759"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020488"},{"key":"e_1_3_2_1_31_1","unstructured":"Executive Office of the President. 2016. Big data: A report on algorithmic systems opportunity and civil rights.  Executive Office of the President. 2016. Big data: A report on algorithmic systems opportunity and civil rights."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00140664"},{"key":"e_1_3_2_1_33_1","volume-title":"1995 b. Sampling from spatial databases. Statistics and Computing","author":"Olken Frank","year":"1995","unstructured":"Frank Olken and Doron Rotem . 1995 b. Sampling from spatial databases. Statistics and Computing ( 1995 ), 43--57. Frank Olken and Doron Rotem. 1995 b. Sampling from spatial databases. Statistics and Computing (1995), 43--57."},{"key":"e_1_3_2_1_34_1","first-page":"01835","article-title":"Sub-Linear Privacy-Preserving Near-Neighbor Search with Untrusted Server on Large-Scale Datasets. (2016)","volume":"1612","author":"Riazi M. Sadegh","year":"2016","unstructured":"M. Sadegh Riazi , Beidi Chen , Anshumali Shrivastava , Dan S. Wallach , and Farinaz Koushanfar . 2016 . Sub-Linear Privacy-Preserving Near-Neighbor Search with Untrusted Server on Large-Scale Datasets. (2016) . ArXiv : 1612 . 01835 . M. Sadegh Riazi, Beidi Chen, Anshumali Shrivastava, Dan S. Wallach, and Farinaz Koushanfar. 2016. Sub-Linear Privacy-Preserving Near-Neighbor Search with Untrusted Server on Large-Scale Datasets. (2016). ArXiv:1612.01835.","journal-title":"ArXiv"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3287560.3287598"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1006\/jmva.1998.1784"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3294052.3322192"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.09.023"}],"event":{"name":"SIGMOD\/PODS '20: International Conference on Management of Data","location":"Portland OR USA","acronym":"SIGMOD\/PODS '20","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3375395.3387648","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3375395.3387648","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:32:48Z","timestamp":1750199568000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3375395.3387648"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,14]]},"references-count":38,"alternative-id":["10.1145\/3375395.3387648","10.1145\/3375395"],"URL":"https:\/\/doi.org\/10.1145\/3375395.3387648","relation":{},"subject":[],"published":{"date-parts":[[2020,6,14]]},"assertion":[{"value":"2020-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}