Tight thresholds for Cuckoo hashing via XORSAT (extended abstract)

DOI10.1007/978-3-642-14165-2_19zbMATH Open1256.68047OpenAlexW1528625750MaRDI QIDQ3587381FDOQ3587381

Authors: Martin Dietzfelbinger, Rasmus Pagh, Michael Rink, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari 

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14165-2_19

Recommendations

• Sharp load thresholds for cuckoo hashing
• Load thresholds for cuckoo hashing with double hashing
• Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
• Bipartite random graphs and Cuckoo hashing
• On risks of using cuckoo hashing with simple universal hash classes

Mathematics Subject Classification ID

Data structures (68P05)

Cited In (37)

• Maximum independent sets on random regular graphs
• Self-stabilizing repeated balls-into-bins
• Matchings on infinite graphs
• Network models: structure and function. Abstracts from the workshop held December 10--16, 2017
• Load Thresholds for Cuckoo Hashing with Overlapping Blocks
• Load thresholds for cuckoo hashing with double hashing
• Dynamic space efficient hashing
• Dynamic space efficient hashing
• Cuckoo hashing in cryptography: optimal parameters, robustness and applications
• The satisfiability threshold for random linear equations
• Maximum matchings in random bipartite graphs and the space utilization of cuckoo hash tables
• Efficient circuit-based PSI via cuckoo hashing
• Hardness of peeling with stashes
• The replica symmetric phase of random constraint satisfaction problems
• Thresholds for extreme orientability
• Sharp load thresholds for cuckoo hashing
• On the phase transition in random simplicial complexes
• The set of solutions of random XORSAT formulae
• The set of solutions of random XORSAT formulae
• Fast scalable construction of ([compressed] static | minimal perfect hash) functions
• The number of satisfying assignments of random 2‐SAT formulas
• Load Thresholds for Cuckoo Hashing with Overlapping Blocks
• The solution space geometry of random linear equations
• Greedy matching in bipartite random graphs
• Orientability Thresholds for Random Hypergraphs
• Satisfiability thresholds beyond \(k\)-XORSAT
• Core forging and local limit theorems for the \(k\)-core of random graphs
• The satisfiability threshold for \(k\)-XORSAT
• Title not available (Why is that?)
• Title not available (Why is that?)
• One-step replica symmetry breaking of random regular NAE-SAT. II
• Count-min sketch with variable number of hash functions: an experimental study
• A new approach to the orientation of random hypergraphs
• The Multiple-Orientability Thresholds for Random Hypergraphs
• Belief propagation on the random \(k\)-SAT model
• Phase transition of the 3-majority dynamics with uniform communication noise
• The rank of sparse random matrices

This page was built for publication: Tight thresholds for Cuckoo hashing via XORSAT (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3587381)