3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit

No abstract is available for this paper.

• Publication year

  2009

• Venue

  Embedded Systems and Applications

• Publication date

  2009-09-07

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-642-04128-0_60
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results

  2009cited by this paper
• Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings

  2008cited by this paper
• More Robust Hashing: Cuckoo Hashing with a Stash

  2008cited by this paper
• The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation

  2007cited by this paper
• The k-orientability thresholds for Gn, p

  2007cited by this paper
• Balanced allocations: the weighted case

  2007cited by this paper
• Using a Queue to De-amortize Cuckoo Hashing in Hardware

  2007cited by this paper
• Balanced allocation on graphs

  2005cited by this paper
• A simple solution to the k‐core problem

  2005cited by this paper
• Efficient hashing with lookups in two memory accesses

  2004cited by this paper
• Almost random graphs with simple hash functions

  2003cited by this paper
• Space Efficient Hash Tables with Worst Case Constant Access Time

  2003cited by this paper
• Using multiple hash functions to improve IP lookups

  2001cited by this paper
• Cuckoo Hashing

  2001influential reference
• Fast Concurrent Access to Parallel Disks

  2000cited by this paper
• Balanced allocations: the heavily loaded case

  2000cited by this paper
• Balanced Allocations

  1999cited by this paper
• How asymmetry helps load balancing

  1999cited by this paper
• Sudden Emergence of a Giantk-Core in a Random Graph

  1996cited by this paper
• Parallel randomized load balancing

  1995cited by this paper
• Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations

  1995cited by this paper
• Shared Memory Simulations with Triple-Logarithmic Delay

  1995cited by this paper
• Dynamic Perfect Hashing: Upper and Lower Bounds

  1994cited by this paper
• Simple, efficient shared memory simulations

  1993cited by this paper
• A New Universal Class of Hash Functions and Dynamic Hashing in Real Time

  1990cited by this paper
• Storing a sparse table with O(1) worst case access time

  1982cited by this paper
• On Observing Nondeterminism and Concurrency

  1980cited by this paper

• Optimal Non-oblivious Open Addressing

  2025cites this paper
• Smaller and More Flexible Cuckoo Filters

  2025cites this paper
• Efficient $d$-ary Cuckoo Hashing at High Load Factors by Bubbling Up

  2025cites this paper
• Two-way Linear Probing Revisited

  2023cites this paper
• What if we tried Less Power? - Lessons from studying the power of choices in hashing-based data structures

  2023cites this paper
• SicHash - Small Irregular Cuckoo Tables for Perfect Hashing

  2022cites this paper
• Insertion Time of Random Walk Cuckoo Hashing below the Peeling Threshold

  2022cites this paper
• Stretching your data with taffy filters

  2021cites this paper
• Random hypergraphs for hashing-based data structures

  2020cites this paper
• Dense Peelable Random Uniform Hypergraphs

  2019cites this paper
• Reversible Garbage Collection for Reversible Functional Languages

  2018cites this paper
• Load Thresholds for Cuckoo Hashing with Overlapping Blocks

  2017influential citation
• Hashing, Load Balancing and Multiple Choice

  2017cites this paper
• Hashing , Load Balancing and Multiple Choice DRAFT ∗

  2017cites this paper
• Fast Concurrent Cuckoo Kick-Out Eviction Schemes for High-Density Tables

  2016cites this paper
• Thresholds for Matchings in Random Bipartite Graphs with Applications to Hashing-Based Data Structures

  2015cites this paper
• Garbage Collection for Reversible Functional Languages

  2015cites this paper
• Privacy-Preserving Patient Tracking for Phase 1 Clinical Trials

  2015cites this paper
• Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket

  2014cites this paper
• On Randomness in Hash Functions

  2012cites this paper
• Cuckoo Hashing with Pages

  2011cites this paper
• A Cuckoo Hashing Variant with Improved Memory Utilization and Insertion Time

  2011influential citation
• Tight Thresholds for Cuckoo Hashing via XORSAT

  2009influential citation
• Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation

  2009cites this paper