Instruct: Given the title of a scientific paper, retrieve paper titles that are cited by the given paper.
Query: Generalized Bloom Filters
Deep packet inspection using parallel Bloom filters
Morton Filters: Faster, Space-Efficient Cuckoo Filters via Biasing, Compression, and Decoupled Logical Sparsity
Concurrent Hash Tables: Fast and General(?)!
A precise analysis of Cuckoo hashing
Binary Optimized Hashing
More Robust Hashing: Cuckoo Hashing with a Stash
Whanau: A Sybil-proof Distributed Hash Table
A new paradigm for collision-free hashing: incrementality at reduced cost
Dynamic Space Efficient Hashing
Opportunistic data structures with applications
Practical perfect hashing in nearly optimal space
Balloon Hashing: Provably Space-Hard Hash Functions with Data-Independent Access Patterns.
Retouched bloom filters: allowing networked applications to trade off selected false positives against false negatives
The Power of Simple Tabulation Hashing
Cache-oblivious streaming B-trees
Oblix: An Efficient Oblivious Search Index
Space Efficient Hash Tables with Worst Case Constant Access Time
Locality-sensitive Hashing without False Negatives
Locality-sensitive hashing scheme based on dynamic collision counting
Skip lists: a probabilistic alternative to balanced trees
A neural network model for detecting DDoS attacks using darknet traffic features
Implementation of an inexpensive EEG headset for the pattern recognition purpose
A SP E M : Embedding Learning by Aspects in Heterogeneous Information Networks
Wave and turbulence measurements at a tidal energy site
Introduction to Algorithms