Nils Fleischhacker, Kasper Green Larsen, Maciej Obremski, Mark Simkin 0001. Invertible Bloom Lookup Tables with Less Memory and Randomness. In Timothy Chan, Johannes Fischer 0001, John Iacono, Grzegorz Herman, editors, 32nd Annual European Symposium on Algorithms, ESA 2024, September 2-4, 2024, Royal Holloway, London, United Kingdom. Volume 308 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. [doi]
@inproceedings{FleischhackerLO24,
title = {Invertible Bloom Lookup Tables with Less Memory and Randomness},
author = {Nils Fleischhacker and Kasper Green Larsen and Maciej Obremski and Mark Simkin 0001},
year = {2024},
doi = {10.4230/LIPIcs.ESA.2024.54},
url = {https://doi.org/10.4230/LIPIcs.ESA.2024.54},
researchr = {https://researchr.org/publication/FleischhackerLO24},
cites = {0},
citedby = {0},
booktitle = {32nd Annual European Symposium on Algorithms, ESA 2024, September 2-4, 2024, Royal Holloway, London, United Kingdom},
editor = {Timothy Chan and Johannes Fischer 0001 and John Iacono and Grzegorz Herman},
volume = {308},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-338-6},
}