% Key papers for Locality-sensitive hashing (scime atlas, https://atlas.scime.ai). Authors are not included: add them from the paper pages.

@inproceedings{aaai2018_asymmetric_102547,
  title = {{Asymmetric Deep Supervised Hashing}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2018},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/11814},
}

@inproceedings{cvpr2018_hashing_13183,
  title = {{Hashing as Tie-Aware Learning to Rank}},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)},
  year = {2018},
  url = {https://openaccess.thecvf.com/content_cvpr_2018/html/He_Hashing_as_Tie-Aware_CVPR_2018_paper.html},
}

@inproceedings{cvpr2023_deep_20744,
  title = {{Deep Hashing With Minimal-Distance-Separated Hash Centers}},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)},
  year = {2023},
  url = {https://cvpr.thecvf.com/virtual/2023/poster/22153},
}

@inproceedings{aaai2019_towards_103498,
  title = {{Towards Optimal Discrete Online Hashing with Balanced Similarity}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2019},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/4896},
}

@inproceedings{cvpr2022_one_19508,
  title = {{One Loss for Quantization: Deep Hashing With Discrete Wasserstein Distributional Matching}},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)},
  year = {2022},
}

@inproceedings{aaai2016_towards_104995,
  title = {{Towards Optimal Binary Code Learning via Ordinal Embedding}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2016},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/10167},
}

@inproceedings{cvpr2016_multilinear_11717,
  title = {{Multilinear Hyperplane Hashing}},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)},
  year = {2016},
}

@inproceedings{icml2017_optimal_36330,
  title = {{Optimal Densification for Fast and Accurate Minwise Hashing}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2017},
  url = {https://icml.cc/virtual/2017/poster/627},
}

@inproceedings{cvpr2019_k_14351,
  title = {{K-Nearest Neighbors Hashing}},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)},
  year = {2019},
}

@inproceedings{aaai2017_ordinal_104529,
  title = {{Ordinal Constrained Binary Code Learning for Nearest Neighbor Search}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2017},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/10906},
}

@inproceedings{neurips2017_practical_56584,
  title = {{Practical Hash Functions for Similarity Estimation and Dimensionality Reduction}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2017},
  url = {https://nips.cc/virtual/2017/poster/9430},
}

@inproceedings{neurips2018_norm_57449,
  title = {{Norm-Ranging LSH for Maximum Inner Product Search}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2018},
  url = {https://nips.cc/virtual/2018/poster/11301},
}

@inproceedings{aaai2017_boosting_103925,
  title = {{Boosting Complementary Hash Tables for Fast Nearest Neighbor Search}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2017},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/11204},
}

@inproceedings{icml2019_sublinear_37769,
  title = {{Sublinear Time Nearest Neighbor Search over Generalized Weighted Space}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2019},
  url = {https://icml.cc/virtual/2019/poster/3631},
}

@inproceedings{neurips2016_an_55576,
  title = {{An ensemble diversity approach to supervised binary hashing}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2016},
  url = {https://nips.cc/virtual/2016/poster/7282},
}

@inproceedings{neurips2019_re_58881,
  title = {{Re-randomized Densification for One Permutation Hashing and Bin-wise Consistent Weighted Sampling}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2019},
  url = {https://nips.cc/virtual/2019/poster/14477},
}

@inproceedings{icml2020_bio_37977,
  title = {{Bio-Inspired Hashing for Unsupervised Similarity Search}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2020},
  url = {https://icml.cc/virtual/2020/poster/6580},
}

@inproceedings{aaai2020_constructing_100661,
  title = {{Constructing Minimal Perfect Hash Functions Using SAT Technology}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2020},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/5529},
}

@inproceedings{aaai2023_sah_4569,
  title = {{SAH: Shifting-Aware Asymmetric Hashing for Reverse k Maximum Inner Product Search}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2023},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/25550},
}

@inproceedings{neurips2019_locality_58555,
  title = {{Locality-Sensitive Hashing for f-Divergences: Mutual Information Loss and Beyond}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2019},
  url = {https://nips.cc/virtual/2019/poster/14026},
}

@inproceedings{iclr2025_pacmann_84099,
  title = {{Pacmann: Efficient Private Approximate Nearest Neighbor Search}},
  booktitle = {International Conference on Learning Representations (ICLR)},
  year = {2025},
  url = {https://iclr.cc/virtual/2025/poster/27729},
}