Parallel Peeling of Invertible Bloom Lookup Tables in a Constant Number of Rounds
Year: 2025
Type: conference-paper
Parent work: SOFSEM 2025: Theory and Practice of Computer Science
Institutions: University of California, Irvine, Harvard University
Language: English
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Open Access status: closed
OpenAlex ID: W4407601396
