Pages that link to "Item:Q3521934"
From MaRDI portal
The following pages link to Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract) (Q3521934):
Displaying 14 items.
- Various improvements to text fingerprinting (Q396662) (← links)
- Fast scalable construction of ([compressed] static | minimal perfect hash) functions (Q776836) (← links)
- Efficient and error-correcting data structures for membership and polynomial evaluation (Q3113749) (← links)
- Sharp load thresholds for cuckoo hashing (Q3168497) (← links)
- An Optimal Bloom Filter Replacement Based on Matrix Solving (Q3392960) (← links)
- Bloom Filters in Adversarial Environments (Q3457085) (← links)
- (Q5075777) (← links)
- (Q5075778) (← links)
- (Q5090472) (← links)
- Binary Fuse Filters: Fast and Smaller Than Xor Filters (Q5102066) (← links)
- Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations (Q5157397) (← links)
- Tight tradeoffs in searchable symmetric encryption (Q5925503) (← links)
- Tight bounds for sliding Bloom filters (Q5963376) (← links)
- Xor Filters (Q6039922) (← links)