Peeling close to the orientability threshold. Spatial coupling in hashing-based data structures
From MaRDI portal
Cites work
- A faster algorithm for cuckoo insertion and bipartite matching in large graphs
- A new approach to the orientation of random hypergraphs
- A recursive approach to low complexity codes
- A simple solution to the k‐core problem
- An Optimal Bloom Filter Replacement Based on Matrix Solving
- Balanced allocation and dictionaries with tightly packed constant size bins
- Balls into bins made faster
- Binary fuse filters: fast and smaller than xor filters
- Bloomier Filters: A Second Look
- Constant-time retrieval with O( m) extra bits
- Cores in random hypergraphs and Boolean formulas
- Cuckoo hashing
- Dense peelable random uniform hypergraphs
- Efficient erasure correcting codes
- scientific article; zbMATH DE number 2042286 (Why is no real title available?)
- scientific article; zbMATH DE number 7525476 (Why is no real title available?)
- Information, Physics, and Computation
- Load thresholds for cuckoo hashing with double hashing
- Maximum matchings in random bipartite graphs and the space utilization of cuckoo hash tables
- Mixed hypergraphs for linear-time construction of denser hashing-based data structures
- Modern Coding Theory
- Network Applications of Bloom Filters: A Survey
- On the insertion time of random walk cuckoo hashing
- Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
- Sharp load thresholds for cuckoo hashing
- Sharp thresholds of graph properties, and the k-sat problem
- Simple and Space-Efficient Minimal Perfect Hash Functions
- Size and connectivity of the \(k\)-core of a random graph
- Some Open Questions Related to Cuckoo Hashing
- Space/time trade-offs in hash coding with allowable errors
- Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation
- Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
- Sudden emergence of a giant k-core in a random graph
- The \(k\)-orientability thresholds for \(G_{n,p}\)
- The Multiple-Orientability Thresholds for Random Hypergraphs
- The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation
- Tight thresholds for Cuckoo hashing via XORSAT (extended abstract)
- Time-varying periodic convolutional codes with low-density parity-check matrix
- Towards optimal degree-distributions for left-perfect matchings in random bipartite graphs
- Wave-Like Solutions of General 1-D Spatially Coupled Systems
- Xor Filters
- XOR-satisfiability set membership filters
This page was built for publication: Peeling close to the orientability threshold. Spatial coupling in hashing-based data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6922349)
