Invertible Bloom Lookup Tables with Less Memory and Randomness

Nils Fleischhacker, Kasper Green Larsen, Maciej Obremski +1

In this work we study Invertible Bloom Lookup Tables (IBLTs) with small failure probabilities. IBLTs are highly versatile data structures that have found applications in set reconc…