scientific article; zbMATH DE number 7525476

DOI10.4230/LIPICS.ESA.2019.39MaRDI QIDQ5075778zbMATH OpenFDO

Authors Martin Dietzfelbinger, Stefan Walzer

Publication date 11 May 2022

Full work available at URL https://arxiv.org/abs/1907.04750

zbMATH Keywords

Bloom filterGauss eliminationhashingrandom band matrixrandomised data structureretrievalRobin Hood hashingsuccinct data structure

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
• Efficient randomized algorithms for the fixed-precision low-rank matrix approximation
• scientific article; zbMATH DE number 5939034
• A fast randomized algorithm for the approximation of matrices
• Fraction free Gaussian elimination for sparse matrices
• Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
• On approximate factorization methods for block matrices suitable for vector and parallel processors
• A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices
• Publication:4734767

Cites work

• A unified approach to linear probing hashing with buckets
• Algebraic Cryptanalysis
• Applications of a Splitting Trick
• Balanced allocation and dictionaries with tightly packed constant size bins
• Constant-time retrieval with O( m) extra bits
• Cores in random hypergraphs and Boolean formulas
• Dense peelable random uniform hypergraphs
• Efficient erasure correcting codes
• Experimental and Efficient Algorithms
• Fast scalable construction of ([compressed] static | minimal perfect hash) functions
• Graphs, hypergraphs and hashing
• scientific article; zbMATH DE number 3764811 (Why is no real title available?)
• scientific article; zbMATH DE number 1256683 (Why is no real title available?)
• scientific article; zbMATH DE number 1559530 (Why is no real title available?)
• scientific article; zbMATH DE number 1436005 (Why is no real title available?)
• scientific article; zbMATH DE number 6469129 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• Individual displacements for linear probing hashing with different insertion policies
• Individual Displacements in Hashing with Coalesced Chains
• Introduction to algorithms.
• Network Applications of Bloom Filters: A Survey
• On parallel computations with banded matrices
• On Worst-Case Robin Hood Hashing
• Probability and Computing
• Simple and Space-Efficient Minimal Perfect Hash Functions
• SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE
• Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain
• Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)

Cited in

(3)

• Constant-time retrieval with O( m) extra bits
• Peeling close to the orientability threshold. Spatial coupling in hashing-based data structures
• Ribbon: fast succinct static retrieval and approximate membership

Describes a project that uses

Uses Software

• BUbiNG
• GitHub

This page was built for publication:

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