Fast private set intersection from homomorphic encryption
Private Set Intersection (PSI) is a cryptographic technique that allows two parties to compute
the intersection of their sets without revealing anything except the intersection. We use fully …
the intersection of their sets without revealing anything except the intersection. We use fully …
Cuckoo hashing
R Pagh, FF Rodler - Journal of Algorithms, 2004 - Elsevier
We present a simple dictionary with worst case constant lookup time, equaling the
theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et …
theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et …
Cuckoo hashing
R Pagh, FF Rodler - European Symposium on Algorithms, 2001 - Springer
We present a simple and efficient dictionary with worst case constant lookup time, equaling
the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger …
the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger …
[BUKU][B] Handbook of data structures and applications
Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …
until now there was no book that focused exclusively on the wide variety of data structures …
Shore-MT: a scalable storage manager for the multicore era
Database storage managers have long been able to efficiently handle multiple concurrent
requests. Until recently, however, a computer contained only a few single-core CPUs, and …
requests. Until recently, however, a computer contained only a few single-core CPUs, and …
Advanced algorithms for fast and scalable deep packet inspection
Modern deep packet inspection systems use regular expressions to define various patterns
of interest in network data streams. Deterministic Finite Automata (DFA) are commonly used …
of interest in network data streams. Deterministic Finite Automata (DFA) are commonly used …
Succinct data structures for assembling large genomes
Motivation: Second-generation sequencing technology makes it feasible for many
researches to obtain enough sequence reads to attempt the de novo assembly of higher …
researches to obtain enough sequence reads to attempt the de novo assembly of higher …
Cuckoo directory: A scalable directory for many-core systems
Growing core counts have highlighted the need for scalable on-chip coherence
mechanisms. The increase in the number of on-chip cores exposes the energy and area …
mechanisms. The increase in the number of on-chip cores exposes the energy and area …
Revisiting hash table design for phase change memory
Phase Change Memory (PCM) is emerging as an attractive alternative to Dynamic Random
Access Memory (DRAM) in building data-intensive computing systems. PCM offers …
Access Memory (DRAM) in building data-intensive computing systems. PCM offers …
On the optimal time/space tradeoff for hash tables
For nearly six decades, the central open question in the study of hash tables has been to
determine the optimal achievable tradeoff curve between time and space. State-of-the-art …
determine the optimal achievable tradeoff curve between time and space. State-of-the-art …