@InProceedings{belazzougui_et_al:LIPIcs.ICALP.2024.20,
author = {Belazzougui, Djamal and Kucherov, Gregory and Walzer, Stefan},
title = {{Better Space-Time-Robustness Trade-Offs for Set Reconciliation}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {20:1--20:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.20},
URN = {urn:nbn:de:0030-drops-201639},
doi = {10.4230/LIPIcs.ICALP.2024.20},
annote = {Keywords: data structures, hashing, set reconciliation, invertible Bloom lookup tables, random hypergraphs, BCH codes}
}