2026-08-13T01:49:56Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:20163 2024-07-02T07:52:49Z ddc:004 open_access

Better Space-Time-Robustness Trade-Offs for Set Reconciliation Belazzougui, Djamal Kucherov, Gregory Walzer, Stefan data structures hashing set reconciliation invertible Bloom lookup tables random hypergraphs BCH codes We consider the problem of reconstructing the symmetric difference between similar sets from their representations (sketches) of size linear in the number of differences. Exact solutions to this problem are based on error-correcting coding techniques and suffer from a large decoding time. Existing probabilistic solutions based on Invertible Bloom Lookup Tables (IBLTs) are time-efficient but offer insufficient success guarantees for many applications. Here we propose a tunable trade-off between the two approaches combining the efficiency of IBLTs with exponentially decreasing failure probability. The proof relies on a refined analysis of IBLTs proposed in (Bæk Tejs Houen et al. SOSA 2023) which has an independent interest. We also propose a modification of our algorithm that enables telling apart the elements of each set in the symmetric difference. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Djamal Belazzougui and Gregory Kucherov and Stefan Walzer 2024 Is Part Of LIPIcs, Volume 297, 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICALP.2024.20 urn:nbn:de:0030-drops-201639 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.20 eng https://creativecommons.org/licenses/by/4.0/legalcode