Description:
We continue our study of the Invertible Bloom Lookup Table and dive into the analysis of the more complicated ListEntries operation. We first show its relation to the 2-core in random hypergraphs and then proceed to give a self-contained analysis of its failure probability. Finally, we discuss how to extend the data structure to handle false deletions.
Share this link via
Or copy link