scientific article; zbMATH DE number 7525475
From MaRDI portal
Publication:5075777
DOI10.4230/LIPIcs.ESA.2019.38MaRDI QIDQ5075777
Martin Dietzfelbinger, Stefan Walzer
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/1907.04749
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast scalable construction of ([compressed static | minimal perfect hash) functions]
- Size and connectivity of the \(k\)-core of a random graph
- The 3-XORSAT threshold.
- Balanced allocation and dictionaries with tightly packed constant size bins
- Mixed Hypergraphs for Linear-Time Construction of Denser Hashing-Based Data Structures
- Sharp load thresholds for cuckoo hashing
- Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables
- An Optimal Bloom Filter Replacement Based on Matrix Solving
- A simple solution to the k‐core problem
- Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
- Bloomier Filters: A Second Look
- Tight Thresholds for Cuckoo Hashing via XORSAT
- Simple and Space-Efficient Minimal Perfect Hash Functions
- Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton’s Identities and Invertible Bloom Filters
- Some Open Questions Related to Cuckoo Hashing
- 3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit
- Efficient erasure correcting codes
- Cuckoo hashing
- Load Thresholds for Cuckoo Hashing with Overlapping Blocks
- Load Thresholds for Cuckoo Hashing with Double Hashing
- Cores in random hypergraphs and Boolean formulas
- The Satisfiability Threshold fork-XORSAT
- The Multiple-Orientability Thresholds for Random Hypergraphs
- A new approach to the orientation of random hypergraphs
This page was built for publication:
