OpenAlex
PricingAboutJobs
Log inGet started
Work

Parallel Peeling of Invertible Bloom Lookup Tables in a Constant Number of Rounds

HTML

Year: 2025
Type: conference-paper
Source: Lecture notes in computer science
Parent work: SOFSEM 2025: Theory and Practice of Computer Science
DOI: 10.1007/978-3-031-82697-9_6
Authors: Michael T. Goodrich, Ryuto Kitagawa, Michael Mitzenmacher
Institutions: University of California, Irvine, Harvard University
Language: English

Topic: Algorithms and Data Compression
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Keywords: probabilistic data structures, set representation, space-time tradeoff, hash functions, random hypergraphs, MapReduce, GPU algorithms

Open Access status: closed
OpenAlex ID: W4407601396
FWCI: 1.478
Cites: 40
Cited by: 3
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security