"Invertible Bloom Lookup Tables with Less Memory and Randomness."

Nils Fleischhacker et al. (2023)

Details and statistics

DOI: 10.48550/ARXIV.2306.07583

access: open

type: Informal or Other Publication

metadata version: 2023-06-17

a service of  Schloss Dagstuhl - Leibniz Center for Informatics