Mixed hypergraphs for linear-time construction of denser hashing-based data structures

DOI10.1007/978-3-642-35843-2_31MaRDI QIDQ2927659zbMATH OpenOpenAlexFDO

Authors Michael Rink

Publication date 4 November 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-35843-2_31

Mathematics Subject Classification ID

Hypergraphs (05C65) Data structures (68P05)

Recommendations

• The multiple-orientability thresholds for random hypergraphs
• Cores of random \(r\)-partite hypergraphs
• The Multiple-Orientability Thresholds for Random Hypergraphs
• Arithmetic progression hypergraphs: examining the second moment method
• Almost random graphs with simple hash functions

Cited in

(7)

• Simple multi-party set reconciliation
• Dense peelable random uniform hypergraphs
• Constant-time retrieval with O( m) extra bits
• Arithmetic progression hypergraphs: examining the second moment method
• Algorithms and Data Structures for Hyperedge Queries
• Count-min sketch with variable number of hash functions: an experimental study
• Peeling close to the orientability threshold. Spatial coupling in hashing-based data structures

This page was built for publication: Mixed hypergraphs for linear-time construction of denser hashing-based data structures

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