Sort bloom refs

ref.bib

@@ -33742,3 +33742,162 @@ @article{wang:pacmdata2023
 address = {New York, NY, USA},
 numpages = 23
 }
+
+@misc{www-lemire-fastmodulo2016,
+  author = {Lemire, Daniel},
+  title = {A fast alternative to the modulo reduction},
+  year = 2017,
+  month = jun,
+  howpublished = {\url{https://lemire.me/blog/2016/06/27/a-fast-alternative-to-the-modulo-reduction/}},
+}
+
+@inproceedings{batcher1968sorting,
+  title={Sorting networks and their applications},
+  author={Batcher, Kenneth E},
+  booktitle={Proceedings of the April 30--May 2, 1968, spring joint computer conference},
+  pages={307--314},
+  year={1968}
+}
+
+@inproceedings{pandey2024bloom,
+  author       = {Prashant Pandey and
+                  Mart{\'{\i}}n Farach{-}Colton and
+                  Niv Dayan and
+                  Huanchen Zhang},
+  editor       = {Pablo Barcel{\'{o}} and
+                  Nayat S{\'{a}}nchez Pi and
+                  Alexandra Meliou and
+                  S. Sudarshan},
+  title        = {Beyond Bloom: {A} Tutorial on Future Feature-Rich Filters},
+  booktitle    = {Companion of the 2024 International Conference on Management of Data,
+                  {SIGMOD/PODS} 2024, Santiago AA, Chile, June 9-15, 2024},
+  pages        = {636--644},
+  publisher    = {{ACM}},
+  year         = {2024},
+  url          = {https://doi.org/10.1145/3626246.3654681},
+  doi          = {10.1145/3626246.3654681},
+  timestamp    = {Fri, 31 May 2024 21:05:26 +0200},
+  biburl       = {https://dblp.org/rec/conf/sigmod/0001FDZ24.bib},
+  bibsource    = {dblp computer science bibliography, https://dblp.org}
+}
+
+@inproceedings{frigo1999oblivious,
+  author={Frigo, M. and Leiserson, C.E. and Prokop, H. and Ramachandran, S.},
+  booktitle={40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)},
+  title={Cache-oblivious algorithms},
+  year={1999},
+  volume={},
+  number={},
+  pages={285-297},
+  keywords={Sorting;Algorithm design and analysis;Strontium;Laboratories;Hardware;Central Processing Unit;Banking},
+  doi={10.1109/SFFCS.1999.814600}
+}
+
+@inproceedings{Bender2004,
+  author={Bender, M.A. and Demaine, E.D. and Farach-Colton, M.},
+  booktitle={Proceedings 41st Annual Symposium on Foundations of Computer Science},
+  title={Cache-oblivious B-trees},
+  year={2000},
+  volume={},
+  number={},
+  pages={399-409},
+  keywords={Data structures;Computer science;Computer networks;Registers;Network-on-a-chip;Algorithm design and analysis;Laboratories;Costs;Central Processing Unit;Clustering algorithms},
+  doi={10.1109/SFCS.2000.892128}
+}
+
+@inproceedings{Brodal2002,
+  author = {Brodal, Gerth St\o{}lting and Fagerberg, Rolf},
+  title = {Funnel Heap - A Cache Oblivious Priority Queue},
+  year = {2002},
+  isbn = {3540001425},
+  publisher = {Springer-Verlag},
+  address = {Berlin, Heidelberg},
+  booktitle = {Proceedings of the 13th International Symposium on Algorithms and Computation},
+  pages = {219–228},
+  numpages = {10},
+  series = {ISAAC '02}
+}
+
+@article{Lemire2020xor,
+  author = {Graf, Thomas Mueller and Lemire, Daniel},
+  title = {Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters},
+  year = {2020},
+  issue_date = {2020},
+  publisher = {Association for Computing Machinery},
+  address = {New York, NY, USA},
+  volume = {25},
+  issn = {1084-6654},
+  url = {https://doi.org/10.1145/3376122},
+  doi = {10.1145/3376122},
+  journal = {ACM J. Exp. Algorithmics},
+  month = mar,
+  articleno = {1.5},
+  numpages = {16},
+  keywords = {Bloom filters, approximate set membership, cuckoo filters}
+}
+
+@InProceedings{dillinger2022ribbon,
+  author =	{Dillinger, Peter C. and H\"{u}bschle-Schneider, Lorenz and Sanders, Peter and Walzer, Stefan},
+  title =	{{Fast Succinct Retrieval and Approximate Membership Using Ribbon}},
+  booktitle =	{20th International Symposium on Experimental Algorithms (SEA 2022)},
+  pages =	{4:1--4:20},
+  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
+  ISBN =	{978-3-95977-251-8},
+  ISSN =	{1868-8969},
+  year =	{2022},
+  volume =	{233},
+  editor =	{Schulz, Christian and U\c{c}ar, Bora},
+  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
+  address =	{Dagstuhl, Germany},
+  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.4},
+  URN =		{urn:nbn:de:0030-drops-165385},
+  doi =		{10.4230/LIPIcs.SEA.2022.4},
+  annote =	{Keywords: AMQ, Bloom filter, dictionary, linear algebra, randomized algorithm, retrieval data structure, static function data structure, succinct data structure, perfect hashing}
+}
+
+@article{evne2022prefix,
+author = {Even, Tomer and Even, Guy and Morrison, Adam},
+title = {Prefix filter: practically and theoretically better than bloom},
+year = {2022},
+issue_date = {March 2022},
+publisher = {VLDB Endowment},
+volume = {15},
+number = {7},
+issn = {2150-8097},
+url = {https://doi.org/10.14778/3523210.3523211},
+doi = {10.14778/3523210.3523211},
+journal = {Proc. VLDB Endow.},
+month = mar,
+pages = {1311–1323},
+numpages = {13}
+}
+
+@inproceedings{Bender2018adaptive,
+  author={Bender, Michael A. and Farach-Colton, Martin and Goswami, Mayank and Johnson, Rob and McCauley, Samuel and Singh, Shikha},
+  booktitle={2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)},
+  title={Bloom Filters, Adaptivity, and the Dictionary Problem},
+  year={2018},
+  volume={},
+  number={},
+  pages={182-193},
+  keywords={Dictionaries;Data structures;Games;Probabilistic logic;Measurement;Computer science;Random access memory;Bloom filters;approximate membership query data structures;adaptive data structures;dictionary data structures},
+  doi={10.1109/FOCS.2018.00026}
+}
+
+@article{mitzenmacher2020adaptivecuckoo,
+  author = {Mitzenmacher, Michael and Pontarelli, Salvatore and Reviriego, Pedro},
+  title = {Adaptive Cuckoo Filters},
+  year = {2020},
+  issue_date = {2020},
+  publisher = {Association for Computing Machinery},
+  address = {New York, NY, USA},
+  volume = {25},
+  issn = {1084-6654},
+  url = {https://doi.org/10.1145/3339504},
+  doi = {10.1145/3339504},
+  journal = {ACM J. Exp. Algorithmics},
+  month = mar,
+  articleno = {1.1},
+  numpages = {20},
+  keywords = {false positive rate, adaptive, Markov chains, Cuckoo hashing, Bloom filters}
+}