Skip to main navigation
Skip to search
Skip to main content
Bar-Ilan University Home
Help & FAQ
Home
Researchers
Organisations
Research output
Prizes
Student theses
Activities
Projects
Press/Media
Datasets
Equipment
Search by expertise, name or affiliation
A space lower bound for dynamic approximate membership data structures
Shachar Lovett,
Ely Porat
Department of Computer Science
University of California at San Diego
Research output
:
Contribution to journal
›
Article
›
peer-review
2
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A space lower bound for dynamic approximate membership data structures'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Error Rate
100%
Space Lower Bound
100%
Bloom Filter
100%
False Positive Error
100%
Information-theoretic Bounds
100%
1-bit
66%
Distributed Systems
33%
New Lower Bound
33%
Database Management Systems
33%
Space Constraints
33%
Dynamic Data Structures
33%
Static Data
33%
Membership Query
33%
Constant Error
33%
False Negative Errors
33%
Database Network
33%
Randomized Data Structures
33%
System Database
33%
Computer Science
Data Structure
100%
False Positive
37%
Bloom Filter
37%
Approximation (Algorithm)
12%
Distributed Systems
12%
Database Systems
12%
False Negative Error
12%
Space Requirement
12%
Constant Factor
12%