scientific article; zbMATH DE number 7559133
From MaRDI portal
Publication:5090472
DOI10.4230/LIPIcs.STACS.2019.24MaRDI QIDQ5090472
Martin Dietzfelbinger, Stefan Walzer
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
retrievalhashingsuccinct data structurestructured Gaussian eliminationrandomised data structuremethod of four Russians
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast scalable construction of ([compressed static | minimal perfect hash) functions]
- Finding succinct ordered minimal perfect hash functions
- 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
- Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
- Algebraic Cryptanalysis
- Tight Thresholds for Cuckoo Hashing via XORSAT
- Simple and Space-Efficient Minimal Perfect Hash Functions
- Hash, Displace, and Compress
- Solving sparse linear equations over finite fields
- The Satisfiability Threshold fork-XORSAT
This page was built for publication:
