The following pages link to Cuckoo hashing (Q4736815):
Displaying 50 items.
- Efficient set intersection with simulation-based security (Q271588) (← links)
- The property suffix tree with dynamic properties (Q294931) (← links)
- External-memory multimaps (Q378243) (← links)
- The universality of iterated hashing over variable-length strings (Q412371) (← links)
- Low-contention data structures (Q433458) (← links)
- Cache-oblivious hashing (Q472489) (← links)
- Explicit and efficient hash families suffice for cuckoo hashing with a stash (Q487008) (← links)
- A generalized birthday approach for efficiently finding linear relations in \(\ell\)-sequences (Q488250) (← links)
- Dynamic proofs of retrievability via oblivious RAM (Q514467) (← links)
- An improved version of cuckoo hashing: average case analysis of construction cost and search operations (Q626960) (← links)
- Transactional memory (Q666225) (← links)
- Layered hashing algorithm for real-time systems (Q692912) (← links)
- Towards a scalable and robust DHT (Q733718) (← links)
- HalftimeHash: modern hashing without 64-bit multipliers or finite fields (Q832844) (← links)
- Support optimality and adaptive cuckoo filters (Q832904) (← links)
- Validating the Knuth-Morris-Pratt failure function, fast and online (Q1678758) (← links)
- Balanced allocation through random walk (Q1685024) (← links)
- Dynamic space efficient hashing (Q1999966) (← links)
- Robust property-preserving hash functions for Hamming distance and more (Q2056796) (← links)
- Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution (Q2056797) (← links)
- Two-sided malicious security for private intersection-sum with cardinality (Q2102051) (← links)
- Private set intersection in the internet setting from lightweight oblivious PRF (Q2102052) (← links)
- PSI from PaXoS: fast, malicious private set intersection (Q2119031) (← links)
- SSE and SSD: page-efficient searchable symmetric encryption (Q2128993) (← links)
- Thresholds for extreme orientability (Q2249738) (← links)
- Pseudo-random graphs and bit probe schemes with one-sided error (Q2254500) (← links)
- Oblivious network RAM and leveraging parallelism to achieve obliviousness (Q2318092) (← links)
- Balanced allocation and dictionaries with tightly packed constant size bins (Q2373735) (← links)
- CuCoTrack: cuckoo filter based connection tracking (Q2414050) (← links)
- Hardness-preserving reductions via cuckoo hashing (Q2423841) (← links)
- An efficient state recovery attack on the X-FCSR family of stream ciphers (Q2442642) (← links)
- Hardness of peeling with stashes (Q2630336) (← links)
- c-trie++: a dynamic trie tailored for fast prefix searches (Q2672225) (← links)
- Generalized cuckoo hashing with a stash, revisited (Q2681400) (← links)
- Adaptively code-correlation robustness functions and its applications to private set intersection (Q2682918) (← links)
- Oblivious RAM with worst-case logarithmic overhead (Q2697677) (← links)
- Approximate nearest neighbor for curves: simple, efficient, and deterministic (Q2701391) (← links)
- Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization (Q2816298) (← links)
- Garbage Collection for Reversible Functional Languages (Q2822492) (← links)
- Online Stochastic Matching: Online Actions Based on Offline Statistics (Q2925346) (← links)
- Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation (Q3012949) (← links)
- Sharp load thresholds for cuckoo hashing (Q3168497) (← links)
- Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables (Q3168498) (← links)
- Hyper-minimisation Made Efficient (Q3182939) (← links)
- (Q3304151) (← links)
- Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process (Q3386520) (← links)
- Bloom Filters in Adversarial Environments (Q3457085) (← links)
- Hopscotch Hashing (Q3540242) (← links)
- Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes (Q3599076) (← links)
- Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Corrected Version) (Q4641588) (← links)
