scientific article; zbMATH DE number 7525476
From MaRDI portal
Publication:5075778
DOI10.4230/LIPIcs.ESA.2019.39MaRDI QIDQ5075778
Stefan Walzer, Martin Dietzfelbinger
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/1907.04750
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gauss eliminationretrievalhashingBloom filtersuccinct data structurerandom band matrixRobin Hood hashingrandomised data structure
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A unified approach to linear probing hashing with buckets
- Fast scalable construction of ([compressed static | minimal perfect hash) functions]
- On parallel computations with banded matrices
- Balanced allocation and dictionaries with tightly packed constant size bins
- Individual displacements for linear probing hashing with different insertion policies
- Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
- Algebraic Cryptanalysis
- SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE
- Simple and Space-Efficient Minimal Perfect Hash Functions
- Individual Displacements in Hashing with Coalesced Chains
- Applications of a Splitting Trick
- Efficient erasure correcting codes
- On Worst-Case Robin Hood Hashing
- Network Applications of Bloom Filters: A Survey
- Cores in random hypergraphs and Boolean formulas
- Probability and Computing
- Experimental and Efficient Algorithms
- Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain
- Graphs, hypergraphs and hashing
This page was built for publication:
